{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:07:59Z","timestamp":1775815679657,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671967","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"1968-1979","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Revisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4158-589X","authenticated-orcid":false,"given":"Yunfei","family":"Liu","sequence":"first","affiliation":[{"name":"Ant Group, Hangzhou, Zhejiang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6405-1531","authenticated-orcid":false,"given":"Jintang","family":"Li","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, Zhejiang, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2786-4116","authenticated-orcid":false,"given":"Yuehe","family":"Chen","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2005-6058","authenticated-orcid":false,"given":"Ruofan","family":"Wu","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4751-8221","authenticated-orcid":false,"given":"Ericbk","family":"Wang","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1701-9384","authenticated-orcid":false,"given":"Jing","family":"Zhou","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3756-5454","authenticated-orcid":false,"given":"Sheng","family":"Tian","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6134-6601","authenticated-orcid":false,"given":"Shuheng","family":"Shen","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3536-2779","authenticated-orcid":false,"given":"Xing","family":"Fu","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8992-9833","authenticated-orcid":false,"given":"Changhua","family":"Meng","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6159-619X","authenticated-orcid":false,"given":"Weiqiang","family":"Wang","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9682-0672","authenticated-orcid":false,"given":"Liang","family":"Chen","sequence":"additional","affiliation":[{"name":"Unaffiliated, Guangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1156-3"},{"key":"e_1_3_2_2_2_1","volume-title":"DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization","author":"Bhowmick Aritra","year":"2024","unstructured":"Aritra Bhowmick, Mert Kosan, Zexi Huang, Ambuj K. Singh, and Sourav Medya. 2024. DGCLUSTER: A Neural Framework for Attributed Graph Clustering via Modularity Maximization. In AAAI. AAAI Press, 11069--11077."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_2_4_1","volume-title":"Maximizing Modularity is hard. arXiv: Data Analysis, Statistics and Probability","author":"Brandes Ulrik","year":"2006","unstructured":"Ulrik Brandes, Daniel Delling, Marco Gaertler, Rachelle Goerke, Martin Hoefer, Zoran Nikoloski, and Donald Wagner. 2006. Maximizing Modularity is hard. arXiv: Data Analysis, Statistics and Probability (2006)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/artl_r_00062"},{"key":"e_1_3_2_2_6_1","unstructured":"Ting Chen Simon Kornblith Mohammad Norouzi and Geoffrey Hinton. 2020. A simple framework for contrastive learning of visual representations. In ICML. Article 149 11 pages."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Jun Jin Choong Xin Liu and Tsuyoshi Murata. 2018. Learning Community Structure with Variational Autoencoder. In ICDM. 69--78.","DOI":"10.1109\/ICDM.2018.00022"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Ganqu Cui Jie Zhou Cheng Yang and Zhiyuan Liu. 2020. Adaptive Graph Encoder for Attributed Graph Embedding. In KDD. 976--985.","DOI":"10.1145\/3394486.3403140"},{"key":"e_1_3_2_2_9_1","unstructured":"Fnu Devvrit Aditya Sinha Inderjit S Dhillon and Prateek Jain. 2022. S3GC: Scalable Self-Supervised Graph Clustering. In NeurIPS Alice H. Oh Alekh Agarwal Danielle Belgrave and Kyunghyun Cho (Eds.)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000022288.19776.77"},{"key":"e_1_3_2_2_11_1","volume-title":"Zhaohan Daniel Guo, Mohammad Gheshlaghi Azar, Bilal Piot, Koray Kavukcuoglu, R\u00e9mi Munos, and Michal Valko.","author":"Grill Jean-Bastien","year":"2020","unstructured":"Jean-Bastien Grill, Florian Strub, Florent Altch\u00e9, Corentin Tallec, Pierre H. Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Avila Pires, Zhaohan Daniel Guo, Mohammad Gheshlaghi Azar, Bilal Piot, Koray Kavukcuoglu, R\u00e9mi Munos, and Michal Valko. 2020. Bootstrap your own latent a new approach to self-supervised learning. In NeurIPS. 14 pages."},{"key":"e_1_3_2_2_12_1","volume-title":"node2vec: Scalable Feature Learning for Networks","author":"Grover Aditya","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. In KDD. Association for Computing Machinery, 855--864."},{"key":"e_1_3_2_2_13_1","volume-title":"2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06)","volume":"2","author":"Hadsell R.","unstructured":"R. Hadsell, S. Chopra, and Y. LeCun. 2006. Dimensionality Reduction by Learning an Invariant Mapping. In 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06), Vol. 2. 1735--1742."},{"key":"e_1_3_2_2_14_1","unstructured":"William L. Hamilton Rex Ying and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. In NeurIPS. 1025--1035."},{"key":"e_1_3_2_2_15_1","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In ICML (ICML'20). JMLR.org Article 385 11 pages."},{"key":"e_1_3_2_2_16_1","unstructured":"R Devon Hjelm Alex Fedorov Samuel Lavoie-Marchildon Karan Grewal Phil Bachman Adam Trischler and Yoshua Bengio. 2019. Learning deep representations by mutual information estimation and maximization. In ICLR."},{"key":"e_1_3_2_2_17_1","unstructured":"Weihua Hu Matthias Fey Marinka Zitnik Yuxiao Dong Hongyu Ren Bowen Liu Michele Catasta and Jure Leskovec. 2020. Open Graph Benchmark: Datasets for Machine Learning on Graphs. In NeurIPS."},{"key":"e_1_3_2_2_18_1","volume-title":"Variational Graph Auto-Encoders. NeurIPS Workshop on Bayesian Deep Learning","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Variational Graph Auto-Encoders. NeurIPS Workshop on Bayesian Deep Learning (2016)."},{"key":"e_1_3_2_2_19_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_2_20_1","unstructured":"Namkyeong Lee Junseok Lee and Chanyoung Park. 2022. Augmentation-Free Self-Supervised Learning on Graphs. (2022)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Jintang Li Ruofan Wu Wangbin Sun Liang Chen Sheng Tian Liang Zhu Changhua Meng Zibin Zheng and Weiqiang Wang. 2023. What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoders. In KDD. ACM 1268--1279.","DOI":"10.1145\/3580305.3599546"},{"key":"e_1_3_2_2_22_1","unstructured":"Jintang Li Huizhe Zhang Ruofan Wu Zulun Zhu Baokun Wang Changhua Meng Zibin Zheng and Liang Chen. 2024. A Graph is Worth 1-bit Spikes: When Graph Contrastive Learning Meets Spiking Neural Networks. In ICLR."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Yunfei Liu Zhen Liu Xiaodong Feng and Zhongyi Li. 2022. Robust Attributed Network Embedding Preserving Community Information. In ICDE. 1874--1886.","DOI":"10.1109\/ICDE53745.2022.00186"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Yixuan Ma and Kun Zhan. 2023. Self-Contrastive Graph Diffusion Network. In ACM MM. 3857--3865.","DOI":"10.1145\/3581783.3611815"},{"key":"e_1_3_2_2_25_1","unstructured":"J. MacQueen. 1967. Some methods for classification and analysis of multivariate observations."},{"key":"e_1_3_2_2_26_1","volume-title":"An effective trust-based recommendation method using a novel graph clustering algorithm. Physica A Statistical Mechanics and its Applications","author":"Moradi Parham","year":"2015","unstructured":"Parham Moradi, Sajad Ahmadian, and Fardin Akhlaghian. 2015. An effective trust-based recommendation method using a novel graph clustering algorithm. Physica A Statistical Mechanics and its Applications, Vol. 436 (2015), 462--481."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2932096"},{"key":"e_1_3_2_2_30_1","volume-title":"Kyuewang Lee, and Jin Young Choi.","author":"Park Jiwoong","year":"2019","unstructured":"Jiwoong Park, Minsik Lee, Hyung Jin Chang, Kyuewang Lee, and Jin Young Choi. 2019. Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning. In ICCV. 6518--6527."},{"key":"e_1_3_2_2_31_1","volume-title":"InfoNCE Loss Provably Learns Cluster-Preserving Representations. In Annual Conference Computational Learning Theory.","author":"Parulekar Advait","year":"2023","unstructured":"Advait Parulekar, Liam Collins, Karthikeyan Shanmugam, Aryan Mokhtari, and Sanjay Shakkottai. 2023. InfoNCE Loss Provably Learns Cluster-Preserving Representations. In Annual Conference Computational Learning Theory."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Bryan Perozzi Rami Al-Rfou and Steven Skiena. 2014. DeepWalk: Online Learning of Social Representations. In KDD. 701--710.","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2022.06.021"},{"key":"e_1_3_2_2_34_1","volume-title":"Pitfalls of Graph Neural Network Evaluation. ArXiv","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of Graph Neural Network Evaluation. ArXiv, Vol. abs\/1811.05868 (2018)."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385415"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3051021"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Wangbin Sun Jintang Li Liang Chen Bingzhe Wu Yatao Bian and Zibin Zheng. 2024. Rethinking and Simplifying Bootstrapped Graph Latents. In WSDM. ACM 665--673.","DOI":"10.1145\/3616855.3635842"},{"key":"e_1_3_2_2_39_1","volume-title":"Bootstrapped Representation Learning on Graphs. In ICLR 2021 Workshop on Geometrical and Topological Representation Learning.","author":"Thakoor Shantanu","year":"2021","unstructured":"Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, Remi Munos, Petar Velivckovi\u0107, and Michal Valko. 2021. Bootstrapped Representation Learning on Graphs. In ICLR 2021 Workshop on Geometrical and Topological Representation Learning."},{"key":"e_1_3_2_2_40_1","volume-title":"From Louvain to","author":"Traag V.","year":"2019","unstructured":"V. Traag, L. Waltman, and Nees Jan van Eck. 2019. From Louvain to Leiden: guaranteeing well-connected communities. Scientific Reports, Vol. 9 (03 2019), 5233."},{"key":"e_1_3_2_2_41_1","article-title":"Graph Clustering with Graph Neural Networks","volume":"24","author":"Tsitsulin Anton","year":"2023","unstructured":"Anton Tsitsulin, John Palowitch, Bryan Perozzi, and Emmanuel M\u00fcller. 2023. Graph Clustering with Graph Neural Networks. J. Mach. Learn. Res., Vol. 24 (2023), 127:1--127:21.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_2_42_1","first-page":"2579","article-title":"Visualizing Data using t-SNE","volume":"9","author":"van der Maaten Laurens","year":"2008","unstructured":"Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing Data using t-SNE. JMLR, Vol. 9, 86 (2008), 2579--2605.","journal-title":"JMLR"},{"key":"e_1_3_2_2_43_1","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_2_44_1","unstructured":"Petar Velickovic William Fedus William L. Hamilton Pietro Li\u00f2 Yoshua Bengio and R Devon Hjelm. 2019. Deep Graph Infomax. In ICLR."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Feng Wang and Huaping Liu. 2021. Understanding the Behaviour of Contrastive Loss. In CVPR. 2495--2504.","DOI":"10.1109\/CVPR46437.2021.00252"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00393"},{"key":"e_1_3_2_2_47_1","unstructured":"Liang Yang Xiaochun Cao Dongxiao He Chuan Wang Xiao Wang and Weixiong Zhang. 2016. Modularity based community detection with deep learning. In IJCAI (IJCAI'16). 2252--2258."},{"key":"e_1_3_2_2_48_1","volume-title":"Cluster-Guided Contrastive Graph Clustering Network","author":"Yang Xihong","unstructured":"Xihong Yang, Yue Liu, Sihang Zhou, Siwei Wang, Wenxuan Tu, Qun Zheng, Xinwang Liu, Liming Fang, and En Zhu. 2023. Cluster-Guided Contrastive Graph Clustering Network. In AAAI. AAAI Press, 9 pages."},{"key":"e_1_3_2_2_49_1","first-page":"5812","article-title":"Graph Contrastive Learning with Augmentations","volume":"33","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph Contrastive Learning with Augmentations. In NeurIPS, Vol. 33. 5812--5823.","journal-title":"NeurIPS"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Cangqi Zhou Yuxiang Wang Jing Zhang Jiqiong Jiang and Dianming Hu. 2022. End-to-end Modularity-based Community Co-partition in Bipartite Networks. In CIKM. 2711--2720.","DOI":"10.1145\/3511808.3557309"},{"key":"e_1_3_2_2_51_1","volume-title":"Deep Graph Contrastive Representation Learning. In ICML Workshop on Graph Representation Learning and Beyond.","author":"Zhu Yanqiao","year":"2020","unstructured":"Yanqiao Zhu, Yichen Xu, Feng Yu, Qiang Liu, Shu Wu, and Liang Wang. 2020. Deep Graph Contrastive Representation Learning. In ICML Workshop on Graph Representation Learning and Beyond."}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain","acronym":"KDD '24","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671967","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:05Z","timestamp":1750291565000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671967"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":51,"alternative-id":["10.1145\/3637528.3671967","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671967","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}