{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:18:11Z","timestamp":1783153091097,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","funder":[{"name":"Key Project of the Natural Science Foundation of Fujian Province","award":["2025J02011"],"award-info":[{"award-number":["2025J02011"]}]},{"name":"Guangzhou Leading Science and Technology Talent Program","award":["2025A04J7076"],"award-info":[{"award-number":["2025A04J7076"]}]},{"name":"National Natural Science Foundation of China","award":["12271098"],"award-info":[{"award-number":["12271098"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,4,13]]},"DOI":"10.1145\/3774904.3792450","type":"proceedings-article","created":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T12:38:33Z","timestamp":1777293513000},"page":"4689-4700","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair\n                    <i>k<\/i>\n                    -Center Clustering on Massive Social Network Data Streams"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"first","affiliation":[{"name":"Fuzhou University, Fuzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6548-390X","authenticated-orcid":false,"given":"Chaoqi","family":"Jia","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1355-3870","authenticated-orcid":false,"given":"Chao","family":"Chen","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Techniques for Generalized Colorful -Center Problems. In 30th Annual European Symposium on Algorithms (ESA","author":"Anegg Georg","year":"2022","unstructured":"Georg Anegg, Laura Vargas Koch, and Rico Zenklusen. 2022. Techniques for Generalized Colorful -Center Problems. In 30th Annual European Symposium on Algorithms (ESA 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_2_1","volume-title":"Fair and Fast -Center Clustering for Data Summarization. In International Conference on Machine Learning (ICML). PMLR, 669-702","author":"Angelidakis Haris","year":"2022","unstructured":"Haris Angelidakis, Adam Kurpisz, Leon Sering, and Rico Zenklusen. 2022. Fair and Fast -Center Clustering for Data Summarization. In International Conference on Machine Learning (ICML). PMLR, 669-702."},{"key":"e_1_3_2_1_3_1","volume-title":"Scalable Fair Clustering. In International Conference on Machine Learning (ICML). PMLR, 405-413","author":"Backurs Arturs","year":"2019","unstructured":"Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, and Tal Wagner. 2019. Scalable Fair Clustering. In International Conference on Machine Learning (ICML). PMLR, 405-413."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"e_1_3_2_1_5_1","volume-title":"Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. Algorithmica","author":"Bandyapadhyay Sayan","year":"2024","unstructured":"Sayan Bandyapadhyay, Zachary Friggstad, and Ramin Mousavi. 2024. Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants. Algorithmica (2024), 1-18."},{"key":"e_1_3_2_1_6_1","volume-title":"Leibniz International Proceedings in Informatics, LIPIcs","volume":"144","author":"Bandyapadhyay Sayan","year":"2019","unstructured":"Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, and Kasturi Varadarajan. 2019. A Constant Approximation for Colorful -Center. Leibniz International Proceedings in Informatics, LIPIcs, Vol. 144 (2019)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512188"},{"key":"e_1_3_2_1_8_1","volume-title":"Approximation Algorithms for Geometric Problems. Approximation algorithms for NP-hard problems","author":"Bern Marshall","year":"1997","unstructured":"Marshall Bern and David Eppstein. 1997. Approximation Algorithms for Geometric Problems. Approximation algorithms for NP-hard problems (1997), 296-345."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645568"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258657"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0010-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114305"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems (NeurIPS). 5036-5044","author":"Chierichetti Flavio","year":"2017","unstructured":"Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair Clustering through Fairlets. In Proceedings of the 31st International Conference on Neural Information Processing Systems (NeurIPS). 5036-5044."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning (ICML). 1877-1886","author":"Chiplunkar Ashish","year":"2020","unstructured":"Ashish Chiplunkar, Sagar Kale, and Sivaramakrishnan Natarajan Ramamoorthy. 2020. How to Solve Fair -Center in Massive Data Models. In Proceedings of the 37th International Conference on Machine Learning (ICML). 1877-1886."},{"key":"e_1_3_2_1_15_1","volume-title":"Fair Clustering in the Sliding Window Model. In The Thirteenth International Conference on Learning Representations (ICLR).","author":"Cohen-Addad Vincent","year":"2025","unstructured":"Vincent Cohen-Addad, Shaofeng H-C Jiang, Qiaoyuan Yang, Yubo Zhang, and Samson Zhou. 2025. Fair Clustering in the Sliding Window Model. In The Thirteenth International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_16_1","volume-title":"Regular Polytopes: 3d Ed","author":"Macdonald Coxeter Harold Scott","unstructured":"Harold Scott Macdonald Coxeter. 1973. Regular Polytopes: 3d Ed. Dover."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2481244.2481246"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62255"},{"key":"e_1_3_2_1_19_1","volume-title":"Certifying and Removing Disparate Impact. In proceedings of the 21st ACM SIGKDD international conference on knowledge discovery and data mining. 259-268","author":"Feldman Michael","year":"2015","unstructured":"Michael Feldman, Sorelle A Friedler, John Moeller, Carlos Scheidegger, and Suresh Venkatasubramanian. 2015. Certifying and Removing Disparate Impact. In proceedings of the 21st ACM SIGKDD international conference on knowledge discovery and data mining. 259-268."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714857"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3696410.3714625"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373464.3373470"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514926"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2025.3574268"},{"key":"e_1_3_2_1_26_1","volume-title":"Improved Streaming Algorithm for Fair -Center Clustering. arXiv preprint arXiv:2510.05937 (AAAI-26)","author":"Guo Longkun","year":"2026","unstructured":"Longkun Guo, Zeyu Lin, Chaoqi Jia, and Chao Chen. 2026. Improved Streaming Algorithm for Fair -Center Clustering. arXiv preprint arXiv:2510.05937 (AAAI-26) (2026)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2016.07.002"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.180"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1177\/0003122417705656"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(79)90044-1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01674-7"},{"key":"e_1_3_2_1_32_1","volume-title":"International Conference on Machine Learning (ICML). PMLR, 4940-4949","author":"Jones Matthew","year":"2020","unstructured":"Matthew Jones, Huy Nguyen, and Thy Nguyen. 2020. Fair -centers via Maximum Matching. In International Conference on Machine Learning (ICML). PMLR, 4940-4949."},{"key":"e_1_3_2_1_33_1","volume-title":"Service in Your Neighborhood: Fairness in Center Location. Foundations of Responsible Computing (FORC)","author":"Jung Christopher","year":"2020","unstructured":"Christopher Jung, Sampath Kannan, and Neil Lutz. 2020. Service in Your Neighborhood: Fairness in Center Location. Foundations of Responsible Computing (FORC) (2020)."},{"key":"e_1_3_2_1_34_1","volume-title":"Algorithms and Techniques (APPROX\/RANDOM 2019","volume":"145","author":"Kale Sagar","year":"2019","unstructured":"Sagar Kale. 2019. Small Space Stream Summary for Matroid Center. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019), Vol. 145 (2019), 20."},{"key":"e_1_3_2_1_35_1","volume-title":"Optimal Quantile Approximation in Streams. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 71-78","author":"Karnin Zohar","year":"2016","unstructured":"Zohar Karnin, Kevin Lang, and Edo Liberty. 2016. Optimal Quantile Approximation in Streams. In 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 71-78."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2702123.2702520"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2015.06.003"},{"key":"e_1_3_2_1_38_1","volume-title":"Fair -Center Clustering for Data Summarization. In International Conference on Machine Learning (ICML). PMLR, 3448-3457","author":"Kleindessner Matth\u00e4us","year":"2019","unstructured":"Matth\u00e4us Kleindessner, Pranjal Awasthi, and Jamie Morgenstern. 2019. Fair -Center Clustering for Data Summarization. In International Conference on Machine Learning (ICML). PMLR, 3448-3457."},{"key":"e_1_3_2_1_39_1","volume-title":"Machine learning with R","author":"Lantz Brett","unstructured":"Brett Lantz. 2015. Machine learning with R. Vol. 452. Packt publishing Birmingham."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-2259-4_8"},{"key":"e_1_3_2_1_41_1","volume-title":"Individual Fairness for -Clustering. In International Conference on Machine Learning (ICML). PMLR, 6586-6596","author":"Mahabadi Sepideh","year":"2020","unstructured":"Sepideh Mahabadi and Ali Vakilian. 2020. Individual Fairness for -Clustering. In International Conference on Machine Learning (ICML). PMLR, 6586-6596."},{"key":"e_1_3_2_1_42_1","volume-title":"Streaming Algorithms for -Center Clustering with Outliers and with Anonymity. Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"McCutchen Richard Matthew","year":"2008","unstructured":"Richard Matthew McCutchen and Samir Khuller. 2008. Streaming Algorithms for -Center Clustering with Outliers and with Anonymity. Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (2008), 165-178."},{"key":"e_1_3_2_1_43_1","volume-title":"March","author":"Mentzer Stuart G","year":"2016","unstructured":"Stuart G Mentzer. 2016. Approximability of Metric Clustering Problems. Unpublished manuscript, March (2016)."},{"key":"e_1_3_2_1_44_1","first-page":"17","volume-title":"21st Annual Symposium on Foundations of Computer Science (SFCS","author":"Micali Silvio","year":"1980","unstructured":"Silvio Micali and Vijay V Vazirani. 1980. An $O(sqrt|V|cdot|E|)$ Algoithm for Finding Maximum Matching in General Graphs. In 21st Annual Symposium on Foundations of Computer Science (SFCS 1980). IEEE, 17-27."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2018.0953"},{"key":"e_1_3_2_1_46_1","first-page":"13340","article-title":"Better Algorithms for Individually Fair -Clustering","volume":"34","author":"Negahbani Maryam","year":"2021","unstructured":"Maryam Negahbani and Deeparnab Chakrabarty. 2021. Better Algorithms for Individually Fair -Clustering. Advances in Neural Information Processing Systems (NeurIPS), Vol. 34 (2021), 13340-13351.","journal-title":"Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/322307.322309"},{"key":"e_1_3_2_1_48_1","unstructured":"Benedek Rozemberczki and Rik Sarkar. 2021. Twitch Gamers: a Dataset for Evaluating Proximity Preserving and Structural Role-based Node Embeddings. arXiv:2101.03091 [cs.SI]"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2522968.2522981"},{"key":"e_1_3_2_1_50_1","volume-title":"International scientific conference and international workshop present day trends of innovations","author":"Takac Lubos","unstructured":"Lubos Takac and Michal Zabovsky. 2012. Data Analysis in Public Social Networks. In International scientific conference and international workshop present day trends of innovations, Vol. 1."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9202"},{"key":"e_1_3_2_1_52_1","volume-title":"Improved Approximation Algorithms for Individually Fair Clustering. In International Conference on Artificial Intelligence and Statistics. PMLR, 8758-8779","author":"Vakilian Ali","year":"2022","unstructured":"Ali Vakilian and Mustafa Yalciner. 2022. Improved Approximation Algorithms for Individually Fair Clustering. In International Conference on Artificial Intelligence and Statistics. PMLR, 8758-8779."},{"key":"e_1_3_2_1_53_1","volume-title":"Online Lewis Weight Sampling. ACM Transactions on Algorithms","author":"Woodruff David P","year":"2023","unstructured":"David P Woodruff and Taisuke Yasuda. 2023. Online Lewis Weight Sampling. ACM Transactions on Algorithms (2023)."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.65109\/VFPI1291"},{"key":"e_1_3_2_1_55_1","unstructured":"I-Cheng Yeh. 2009. Default of Credit Card Clients. UCI Machine Learning Repository. DOI: https:\/\/doi.org\/10.24432"}],"event":{"name":"WWW '26: The ACM Web Conference 2026","location":"Dubai United Arab Emirates","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2026"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774904.3792450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:44:21Z","timestamp":1783151061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774904.3792450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,12]]},"references-count":55,"alternative-id":["10.1145\/3774904.3792450","10.1145\/3774904"],"URL":"https:\/\/doi.org\/10.1145\/3774904.3792450","relation":{},"subject":[],"published":{"date-parts":[[2026,4,12]]},"assertion":[{"value":"2026-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}