{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T10:17:29Z","timestamp":1778408249522,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100013209","name":"Hellenic Foundation for Research and Innovation","doi-asserted-by":"publisher","award":["016636"],"award-info":[{"award-number":["016636"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100013209","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,22]]},"DOI":"10.1145\/3696410.3714625","type":"proceedings-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T16:42:02Z","timestamp":1746463322000},"page":"506-517","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Fair Network Communities through Group Modularity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5168-8173","authenticated-orcid":false,"given":"Christos","family":"Gkartzios","sequence":"first","affiliation":[{"name":"University of Ioannina, Ioannina, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3775-4995","authenticated-orcid":false,"given":"Evaggelia","family":"Pitoura","sequence":"additional","affiliation":[{"name":"University of Ioannina, Ioannina, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3490-1507","authenticated-orcid":false,"given":"Panayiotis","family":"Tsaparas","sequence":"additional","affiliation":[{"name":"University of Ioannina, Ioannina, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Mohsen Abbasi Aditya Bhaskara and Suresh Venkatasubramanian. 2021. Fair Clustering via Equitable Group Representations. In FAccT. 504--514.","DOI":"10.1145\/3442188.3445913"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330960"},{"key":"e_1_3_2_1_3_1","volume-title":"ICML (Proceedings of Machine Learning Research","volume":"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 ICML (Proceedings of Machine Learning Research, Vol. 97). PMLR, 405--413."},{"key":"e_1_3_2_1_4_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Bera Suman","year":"2019","unstructured":"Suman Bera, Deeparnab Chakrabarty, Nicolas Flores, and Maryam Negahbani. 2019a. Fair algorithms for clustering. Advances in Neural Information Processing Systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_5_1","unstructured":"Suman K. Bera Deeparnab Chakrabarty Nicolas J. Flores and Maryam Negahbani. 2019b. Fair Algorithms for Clustering. In NeurIPS. 4955--4966."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512188"},{"key":"e_1_3_2_1_7_1","article-title":"Fast unfolding of communities in large networks","volume":"10","author":"Blondel Vincent D","year":"2008","unstructured":"Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, Vol. 10 (2008).","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645568"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15","volume":"1041","author":"Chen Xingyu","year":"2019","unstructured":"Xingyu Chen, Brandon Fain, Liang Lyu, and Kamesh Munagala. 2019. Proportionally Fair Clustering. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research, Vol. 97). PMLR, 1032--1041."},{"key":"e_1_3_2_1_10_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair Clustering Through Fairlets. In NeurIPS. 5029--5037."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3265598"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Moritz Hardt Toniann Pitassi Omer Reingold and Rich Zemel. 2012. Fairness through awareness. In ITCS. ACM 214--226.","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_1_14_1","volume-title":"Kleinberg","author":"Easley David A.","year":"2010","unstructured":"David A. Easley and Jon M. Kleinberg. 2010. Networks, Crowds, and Markets - Reasoning About a Highly Connected World. Cambridge University Press."},{"key":"e_1_3_2_1_15_1","volume-title":"Community detection in graphs. Physics reports","author":"Fortunato Santo","year":"2010","unstructured":"Santo Fortunato. 2010. Community detection in graphs. Physics reports, Vol. 486, 3--5 (2010), 75--174."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Mehrdad Ghadiri Samira Samadi and Santosh Vempala. 2021. Socially Fair k-Means Clustering. In FAccT. ACM 438--448.","DOI":"10.1145\/3442188.3445906"},{"key":"e_1_3_2_1_17_1","volume-title":"Seyed Amjad Seyedi, and Eirini Ntoutsi","author":"Ghodsi Siamak","year":"2024","unstructured":"Siamak Ghodsi, Seyed Amjad Seyedi, and Eirini Ntoutsi. 2024. Towards Cohesion-Fairness Harmony: Contrastive Regularization in Individual Fair Graph Clustering. In Advances in Knowledge Discovery and Data Mining - 28th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2024, Taipei, Taiwan, May 7--10, 2024, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 14645). Springer, 284--296."},{"key":"e_1_3_2_1_18_1","volume-title":"Protecting Individual Interests across Clusters: Spectral Clustering with Guarantees. CoRR","author":"Gupta Shubham","year":"2021","unstructured":"Shubham Gupta and Ambedkar Dukkipati. 2021. Protecting Individual Interests across Clusters: Spectral Clustering with Guarantees. CoRR, Vol. abs\/2105.03714 (2021). showeprint[arXiv]2105.03714 https:\/\/arxiv.org\/abs\/2105.03714"},{"key":"e_1_3_2_1_19_1","volume-title":"Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022","author":"Gupta Shubham","year":"2022","unstructured":"Shubham Gupta and Ambedkar Dukkipati. 2022. Consistency of Constrained Spectral Clustering under Graph Induced Fair Planted Partitions. In Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1111\/itor.13224"},{"key":"e_1_3_2_1_22_1","volume-title":"Data clustering: a review. ACM computing surveys (CSUR)","author":"Jain Anil K","year":"1999","unstructured":"Anil K Jain, M Narasimha Murty, and Patrick J Flynn. 1999. Data clustering: a review. ACM computing surveys (CSUR), Vol. 31, 3 (1999), 264--323."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Jian Kang Jingrui He Ross Maciejewski and Hanghang Tong. 2020. InFoRM: Individual Fairness on Graph Mining. In KDD. ACM 379--389.","DOI":"10.1145\/3394486.3403080"},{"key":"e_1_3_2_1_24_1","first-page":"3458","article-title":"Guarantees for Spectral Clustering with Fairness Constraints","volume":"97","author":"Kleindessner Matth\u00e4us","year":"2019","unstructured":"Matth\u00e4us Kleindessner, Samira Samadi, Pranjal Awasthi, and Jamie Morgenstern. 2019. Guarantees for Spectral Clustering with Fairness Constraints. In ICML, Vol. 97. 3458--3467.","journal-title":"ICML"},{"key":"e_1_3_2_1_25_1","volume-title":"Ullman","author":"Leskovec Jure","year":"2014","unstructured":"Jure Leskovec, Anand Rajaraman, and Jeffrey D. Ullman. 2014. Mining of Massive Datasets, 2nd Ed. Cambridge University Press.","edition":"2"},{"key":"e_1_3_2_1_26_1","first-page":"6586","article-title":"Individual Fairness for k-Clustering","volume":"119","author":"Mahabadi Sepideh","year":"2020","unstructured":"Sepideh Mahabadi and Ali Vakilian. 2020. Individual Fairness for k-Clustering. In ICML, Vol. 119. 6586--6596.","journal-title":"ICML"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3625007.3627518"},{"key":"e_1_3_2_1_28_1","volume-title":"Bursting the Filter Bubble: Fairness-Aware Network Link Prediction","author":"Masrour Farzan","unstructured":"Farzan Masrour, Tyler Wilson, Heng Yan, Pang-Ning Tan, and Abdol-Hossein Esfahanian. 2020. Bursting the Filter Bubble: Fairness-Aware Network Link Prediction. In AAAI. AAAI Press, 841--848."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3457607"},{"key":"e_1_3_2_1_30_1","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman M. E. J.","year":"2004","unstructured":"M. E. J. Newman. 2004. Fast algorithm for detecting community structure in networks. Phys. Rev. E, Vol. 69 (2004).","journal-title":"Phys. Rev. E"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00697-y"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3653711"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-41695-z"},{"key":"e_1_3_2_1_34_1","volume-title":"Link Recommendations for PageRank Fairness. In WWW '22: The ACM Web Conference 2022","author":"Tsioutsiouliklis Sotiris","year":"2022","unstructured":"Sotiris Tsioutsiouliklis, Evaggelia Pitoura, Konstantinos Semertzidis, and Panayiotis Tsaparas. 2022. Link Recommendations for PageRank Fairness. In WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022. ACM, 3541--3551."},{"key":"e_1_3_2_1_35_1","volume-title":"Fairness-Aware PageRank. In WWW '21: The Web Conference 2021","author":"Tsioutsiouliklis Sotiris","year":"2021","unstructured":"Sotiris Tsioutsiouliklis, Evaggelia Pitoura, Panayiotis Tsaparas, Ilias Kleftakis, and Nikos Mamoulis. 2021. Fairness-Aware PageRank. In WWW '21: The Web Conference 2021, Virtual Event \/ Ljubljana, Slovenia, April 19--23, 2021. ACM \/ IW3C2, 3815--3826."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3194770.3194776"},{"key":"e_1_3_2_1_37_1","volume-title":"International Conference on Artificial Intelligence and Statistics, 25--27","author":"Wang Ji","year":"2023","unstructured":"Ji Wang, Ding Lu, Ian Davidson, and Zhaojun Bai. 2023. Scalable Spectral Clustering with Group Fairness Constraints. In International Conference on Artificial Intelligence and Statistics, 25--27 April 2023, Palau de Congressos, Valencia, Spain (Proceedings of Machine Learning Research, Vol. 206). PMLR, 6613--6629."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData55660.2022.10020548"},{"key":"e_1_3_2_1_39_1","volume-title":"Mohammad Ali Abbasi, and Huan Liu","author":"Zafarani Reza","year":"2014","unstructured":"Reza Zafarani, Mohammad Ali Abbasi, and Huan Liu. 2014. Social Media Mining: An Introduction. Cambridge University Press."}],"event":{"name":"WWW '25: The ACM Web Conference 2025","location":"Sydney NSW Australia","acronym":"WWW '25","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714625","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:56Z","timestamp":1750295936000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":39,"alternative-id":["10.1145\/3696410.3714625","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714625","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}