{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T01:55:10Z","timestamp":1769306110162,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1947203, IIS-2117902, and IIS-2137468"],"award-info":[{"award-number":["IIS-1947203, IIS-2117902, and IIS-2137468"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583423","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:25Z","timestamp":1682551825000},"page":"3755-3765","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Fairness-Aware Clique-Preserving Spectral\u00a0Clustering\u00a0of\u00a0Temporal\u00a0Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8726-9234","authenticated-orcid":false,"given":"Dongqi","family":"Fu","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3611-4363","authenticated-orcid":false,"given":"Dawei","family":"Zhou","sequence":"additional","affiliation":[{"name":"Virginia Tech, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8803-6355","authenticated-orcid":false,"given":"Ross","family":"Maciejewski","sequence":"additional","affiliation":[{"name":"Arizona State University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8470-9273","authenticated-orcid":false,"given":"Arie","family":"Croitoru","sequence":"additional","affiliation":[{"name":"George Mason University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6872-2216","authenticated-orcid":false,"given":"Marcus","family":"Boyd","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6429-6272","authenticated-orcid":false,"given":"Jingrui","family":"He","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics","author":"Adamcsek Bal\u00e1zs","year":"2006","unstructured":"Bal\u00e1zs Adamcsek, Gergely Palla, Ill\u00e9s\u00a0J. Farkas, Imre Der\u00e9nyi, and Tam\u00e1s Vicsek. 2006. CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics (2006)."},{"key":"e_1_3_2_1_2_1","volume-title":"Aggarwal and Karthik Subbian","author":"C.","year":"2014","unstructured":"Charu\u00a0C. Aggarwal and Karthik Subbian. 2014. Evolutionary Network Analysis: A Survey. ACM Comput. Surv. (2014)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Sitaram Asur Srinivasan Parthasarathy and Duygu Ucar. 2007. An event-based framework for characterizing the evolutionary behavior of interaction graphs. In KDD.","DOI":"10.1145\/1281192.1281290"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Austin\u00a0R. Benson David\u00a0F. Gleich and Jure Leskovec. 2015. Tensor Spectral Clustering for Partitioning Higher-order Network Structures. In SDM.","DOI":"10.1137\/1.9781611974010.14"},{"key":"e_1_3_2_1_5_1","volume-title":"Higher-order organization of complex networks. Science","author":"Benson R.","year":"2016","unstructured":"Austin\u00a0R. Benson, David\u00a0F. Gleich, and Jure Leskovec. 2016. Higher-order organization of complex networks. Science (2016)."},{"key":"e_1_3_2_1_6_1","unstructured":"Suman\u00a0Kalyan Bera Deeparnab Chakrabarty Nicolas Flores and Maryam Negahbani. 2019. Fair Algorithms for Clustering. In NeurIPS."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Aldo\u00a0G. Carranza Ryan\u00a0A. Rossi Anup Rao and Eunyee Koh. 2020. Higher-order Clustering in Complex Heterogeneous Networks. In KDD.","DOI":"10.1145\/3394486.3403045"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Deepayan Chakrabarti Ravi Kumar and Andrew Tomkins. 2006. Evolutionary Clustering. In KDD.","DOI":"10.1145\/1150402.1150467"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Chen Chen and Hanghang Tong. 2015. Fast Eigen-Functions Tracking on Dynamic Graphs. In SDM.","DOI":"10.1137\/1.9781611974010.63"},{"key":"e_1_3_2_1_10_1","unstructured":"Chen Chen and Hanghang Tong. 2017. On the eigen-functions of dynamic graphs: Fast tracking and attribution algorithms. Stat. Anal. Data Min. (2017)."},{"key":"e_1_3_2_1_11_1","unstructured":"Xingyu Chen Brandon Fain Liang Lyu and Kamesh Munagala. 2019. Proportionally Fair Clustering. In ICML."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Yun Chi Xiaodan Song Dengyong Zhou Koji Hino and Belle\u00a0L. Tseng. 2007. Evolutionary spectral clustering by incorporating temporal smoothness. In KDD.","DOI":"10.1145\/1281192.1281212"},{"key":"e_1_3_2_1_13_1","series-title":"SIAM J. Comput. (1985)","volume-title":"Arboricity and Subgraph Listing Algorithms","author":"Chiba Norishige","unstructured":"Norishige Chiba and Takao Nishizeki. 1985. Arboricity and Subgraph Listing Algorithms. SIAM J. Comput. (1985)."},{"key":"e_1_3_2_1_14_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair Clustering Through Fairlets. In NeurIPS."},{"key":"e_1_3_2_1_15_1","volume-title":"Clique Percolation in Random Networks. Physical Review Letters","author":"Der\u00e9nyi Imre","year":"2005","unstructured":"Imre Der\u00e9nyi, Gergely Palla, and Tam\u00e1s Vicsek. 2005. Clique Percolation in Random Networks. Physical Review Letters (2005)."},{"key":"e_1_3_2_1_16_1","volume-title":"Contact Patterns among High School Students. PLoS ONE","author":"Fournet Julie","year":"2014","unstructured":"Julie Fournet and Alain Barrat. 2014. Contact Patterns among High School Students. PLoS ONE (2014)."},{"key":"e_1_3_2_1_17_1","volume-title":"DISCO: Comprehensive and Explainable Disinformation Detection. In CIKM","author":"Fu Dongqi","year":"2022","unstructured":"Dongqi Fu, Yikun Ban, Hanghang Tong, Ross Maciejewski, and Jingrui He. 2022. DISCO: Comprehensive and Explainable Disinformation Detection. In CIKM 2022."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539313"},{"key":"e_1_3_2_1_19_1","volume-title":"SDG: A Simplified and Dynamic Graph Neural Network. In SIGIR.","author":"Fu Dongqi","year":"2021","unstructured":"Dongqi Fu and Jingrui He. 2021. SDG: A Simplified and Dynamic Graph Neural Network. In SIGIR."},{"key":"e_1_3_2_1_20_1","volume-title":"Natural and Artificial Dynamics in Graphs: Concept, Progress, and Future. Frontiers in Big Data","author":"Fu Dongqi","year":"2022","unstructured":"Dongqi Fu and Jingrui He. 2022. Natural and Artificial Dynamics in Graphs: Concept, Progress, and Future. Frontiers in Big Data (2022)."},{"key":"e_1_3_2_1_21_1","unstructured":"Dongqi Fu Dawei Zhou and Jingrui He. 2020. Local Motif Clustering on Time-Evolving Graphs. In KDD."},{"key":"e_1_3_2_1_22_1","volume-title":"Mitigation of infectious disease at school: targeted class closure vs school closure.BMC infectious diseases","author":"Gemmetto Valerio","year":"2014","unstructured":"Valerio Gemmetto, Alain Barrat, and Ciro Cattuto. 2014. Mitigation of infectious disease at school: targeted class closure vs school closure.BMC infectious diseases (2014)."},{"key":"e_1_3_2_1_23_1","volume-title":"Social networks","author":"Granovetter S","unstructured":"Mark\u00a0S Granovetter. 1977. The strength of weak ties. In Social networks. Elsevier."},{"key":"e_1_3_2_1_24_1","unstructured":"Lingxiao Huang Shaofeng\u00a0H.-C. Jiang and Nisheeth\u00a0K. Vishnoi. 2019. Coresets for Clustering with Fairness Constraints. In NeurIPS."},{"key":"e_1_3_2_1_25_1","unstructured":"Ling Huang Donghui Yan Michael\u00a0I. Jordan and Nina Taft. 2008. Spectral Clustering with Perturbed Data. In NeurIPS."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Jian Kang Jingrui He Ross Maciejewski and Hanghang Tong. 2020. InFoRM: Individual Fairness on Graph Mining. In KDD.","DOI":"10.1145\/3394486.3403080"},{"key":"e_1_3_2_1_27_1","volume-title":"InfoFair: Information-Theoretic Intersectional Fairness","author":"Kang Jian","unstructured":"Jian Kang, Tiankai Xie, Xintao Wu, Ross Maciejewski, and Hanghang Tong. 2022. InfoFair: Information-Theoretic Intersectional Fairness. In IEEE BigData."},{"key":"e_1_3_2_1_28_1","unstructured":"Seyed\u00a0Mehran Kazemi Rishab Goel Kshitij Jain Ivan Kobyzev Akshay Sethi Peter Forsyth and Pascal Poupart. 2020. Representation Learning for Dynamic Graphs: A Survey. J. Mach. Learn. Res. (2020)."},{"key":"e_1_3_2_1_29_1","unstructured":"Matth\u00e4us Kleindessner Samira Samadi Pranjal Awasthi and Jamie Morgenstern. 2019. Guarantees for Spectral Clustering with Fairness Constraints. In ICML."},{"key":"e_1_3_2_1_30_1","volume":"200","author":"Kossinets Gueorgi","unstructured":"Gueorgi Kossinets and Duncan\u00a0J Watts. 2006. Empirical analysis of an evolving social network. Science (2006).","journal-title":"J Watts."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Liangyue Li and Hanghang Tong. 2020. Computational Approaches to the Network Science of Teams. (2020).","DOI":"10.1017\/9781108683173"},{"key":"e_1_3_2_1_32_1","unstructured":"Peizhao Li Han Zhao and Hongfu Liu. 2020. Deep Fair Clustering for Visual Learning. In CVPR."},{"key":"e_1_3_2_1_33_1","volume-title":"Handbook of matrices. Vol.\u00a01","author":"L\u00fctkepohl Helmut","unstructured":"Helmut L\u00fctkepohl. 1996. Handbook of matrices. Vol.\u00a01. Wiley Chichester."},{"key":"e_1_3_2_1_34_1","unstructured":"Lionel Martin Andreas Loukas and Pierre Vandergheynst. 2018. Fast Approximate Spectral Clustering for Dynamic Networks. In ICML."},{"key":"e_1_3_2_1_35_1","volume-title":"Contact Patterns in a High School: A Comparison between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys. PLOS ONE","author":"Mastrandrea Rossana","year":"2015","unstructured":"Rossana Mastrandrea, Julie Fournet, and Alain Barrat. 2015. Contact Patterns in a High School: A Comparison between Data Collected Using Wearable Sensors, Contact Diaries and Friendship Surveys. PLOS ONE (2015)."},{"key":"e_1_3_2_1_36_1","unstructured":"Andrew\u00a0Y. Ng Michael\u00a0I. Jordan and Yair Weiss. 2001. On Spectral Clustering: Analysis and an algorithm. In NeurIPS."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Huazhong Ning Wei Xu Yun Chi Yihong Gong and Thomas\u00a0S. Huang. 2007. Incremental Spectral Clustering With Application to Monitoring of Evolving Blog Communities. In SDM.","DOI":"10.1137\/1.9781611972771.24"},{"key":"e_1_3_2_1_38_1","volume-title":"Incremental spectral clustering by efficiently updating the eigen-system. Pattern Recognition","author":"Ning Huazhong","year":"2010","unstructured":"Huazhong Ning, Wei Xu, Yun Chi, Yihong Gong, and Thomas\u00a0S Huang. 2010. Incremental spectral clustering by efficiently updating the eigen-system. Pattern Recognition (2010)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_3_2_1_40_1","volume-title":"For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in Norway. Scandinavian Journal of Management","author":"Seierstad Cathrine","year":"2011","unstructured":"Cathrine Seierstad and Tore Opsahl. 2011. For the few not the many? The effects of affirmative action on presence, prominence, and social capital of women directors in Norway. Scandinavian Journal of Management (2011)."},{"key":"e_1_3_2_1_41_1","volume-title":"Normalized Cuts and Image Segmentation","author":"Shi Jianbo","year":"2000","unstructured":"Jianbo Shi and Jitendra Malik. 2000. Normalized Cuts and Image Segmentation. IEEE Trans. Pattern Anal. Mach. Intell. (2000)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Hanghang Tong Spiros Papadimitriou Philip\u00a0S. Yu and Christos Faloutsos. 2008. Proximity Tracking on Time-Evolving Bipartite Graphs. In SDM.","DOI":"10.1137\/1.9781611972788.64"},{"key":"e_1_3_2_1_43_1","volume-title":"Social Structure of Facebook Networks. CoRR","author":"Traud L.","year":"2011","unstructured":"Amanda\u00a0L. Traud, Peter\u00a0J. Mucha, and Mason\u00a0A. Porter. 2011. Social Structure of Facebook Networks. CoRR (2011)."},{"key":"e_1_3_2_1_44_1","unstructured":"Rakshit Trivedi Mehrdad Farajtabar Prasenjeet Biswal and Hongyuan Zha. 2019. DyRep: Learning Representations over Dynamic Graphs. In ICLR."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Charalampos\u00a0E. Tsourakakis Jakub Pachocki and Michael Mitzenmacher. 2017. Scalable Motif-aware Graph Clustering. In WWW.","DOI":"10.1145\/3038912.3052653"},{"key":"e_1_3_2_1_46_1","volume-title":"Estimating Potential Infection Transmission Routes in Hospital Wards Using Wearable Proximity Sensors. PLoS ONE","author":"Vanhems Philippe","year":"2013","unstructured":"Philippe Vanhems, Alain Barrat, Ciro Cattuto, Jean-Fran\u00e7ois Pinton, Nagham Khanafer, Corinne R\u00e9gis, Byeul-a Kim, Brigitte Comte, and Nicolas Voirin. 2013. Estimating Potential Infection Transmission Routes in Hospital Wards Using Wearable Proximity Sensors. PLoS ONE (2013)."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Ulrike von Luxburg. 2007. A tutorial on spectral clustering. Stat. Comput. (2007).","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_3_2_1_48_1","volume-title":"Construction and application of dynamic protein interaction network based on time course gene expression data. Proteomics","author":"Wang Jianxin","year":"2013","unstructured":"Jianxin Wang, Xiaoqing Peng, Min Li, and Yi Pan. 2013. Construction and application of dynamic protein interaction network based on time course gene expression data. Proteomics (2013)."},{"key":"e_1_3_2_1_49_1","volume-title":"iFiG: Individually Fair Multi-view Graph Clustering","author":"Wang Yian","unstructured":"Yian Wang, Jian Kang, Yinglong Xia, Jiebo Luo, and Hanghang Tong. 2022. iFiG: Individually Fair Multi-view Graph Clustering. In IEEE BigData."},{"key":"e_1_3_2_1_50_1","volume-title":"Resource allocation in public hospitals: Is it effective?Health Policy","author":"Withanachchi Nimnath","year":"2007","unstructured":"Nimnath Withanachchi, Yasuo Uchida, Shyama Nanayakkara, Dulani Samaranayake, and Akiko Okitsu. 2007. Resource allocation in public hospitals: Is it effective?Health Policy (2007)."},{"key":"e_1_3_2_1_51_1","unstructured":"Tao Wu Austin\u00a0R. Benson and David\u00a0F. Gleich. 2016. General Tensor Spectral Co-clustering for Higher-Order Data. In NeurIPS."},{"key":"e_1_3_2_1_52_1","unstructured":"Donghui Yan Ling Huang and Michael\u00a0I. Jordan. 2009. Fast approximate spectral clustering. In KDD."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Hao Yin Austin\u00a0R. Benson Jure Leskovec and David\u00a0F. Gleich. 2017. Local Higher-Order Graph Clustering. In KDD.","DOI":"10.1145\/3097983.3098069"},{"key":"e_1_3_2_1_54_1","volume-title":"Motif-Preserving Dynamic Local Graph Cut","author":"Zhou Dawei","unstructured":"Dawei Zhou, Jingrui He, Hasan Davulcu, and Ross Maciejewski. 2018. Motif-Preserving Dynamic Local Graph Cut. In IEEE BigData."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Dawei Zhou Si Zhang Mehmet\u00a0Yigit Yildirim Scott Alcorn Hanghang Tong Hasan Davulcu and Jingrui He. 2017. A Local Algorithm for Structure-Preserving Graph Cut. In KDD.","DOI":"10.1145\/3097983.3098015"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583423","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3543507.3583423","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583423","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:52Z","timestamp":1750178872000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":55,"alternative-id":["10.1145\/3543507.3583423","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583423","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}