{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:41:28Z","timestamp":1778694088616,"version":"3.51.4"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities of China","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71871233"],"award-info":[{"award-number":["71871233"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,1,31]]},"abstract":"<jats:p>\n            Overlapping graph clustering is essential to understand the nature and behavior of real complex systems including human interactions, technical systems and transportation network. However, in addition of topological structure, many real-world networked systems contain spare factors, i.e., attributes of networks. Despite the considerable efforts that have been made in graph clustering, they only concentrate on the topological structure, which lack a profound understanding of cluster configuration on attributed graphs. To address this great challenge, in this article, we propose a new overlapping graph clustering algorithm by integrating the topological and attributive information into a\n            <jats:italic>cluster potential game<\/jats:italic>\n            (CPG). Firstly, a generalized definition of the utility function is provided, which measures the payoff of each node based on different node-to-cluster distance functions. It is worth mentioning that the model we proposed is able to associate with the classic ordinal potential game well. Then, we define the measures of both tightness and the homogeneity in each cluster, and introduce a novel two-way selection mechanism. The goal is to extend the flexibility of the cluster potential game, so that one can achieve a win-win situation between nodes and clusters. Finally, a distributed and heterogeneous multiagent system (DHMAS) is carefully designed based on a fast self-learning algorithm (SLA) for attributed overlapping graph clustering. Two series of experiments are implemented in multi-types datasets and the results verify the effectiveness and the scalability after the comparison with the most advanced approaches of literature.\n          <\/jats:p>","DOI":"10.1145\/3597436","type":"journal-article","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T12:16:46Z","timestamp":1684412206000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Overlapping Graph Clustering in Attributed Networks via Generalized Cluster Potential Game"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1000-717X","authenticated-orcid":false,"given":"Hui-Jia","family":"Li","sequence":"first","affiliation":[{"name":"School of Statistics and Data Science, Nankai University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8047-6919","authenticated-orcid":false,"given":"Yuhao","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Science, Beijing University of Posts and Telecommunications, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2686-5072","authenticated-orcid":false,"given":"Chengyi","family":"Xia","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Tiangong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7049-5614","authenticated-orcid":false,"given":"Jie","family":"Cao","sequence":"additional","affiliation":[{"name":"Research Institute of Big Knowledge, Hefei University of Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"e_1_3_2_2_2","volume-title":"Exploring complex networks. Nature 410, 6825","author":"Strogatz Steven H.","year":"2001","unstructured":"Steven H. Strogatz . 2001. Exploring complex networks. Nature 410, 6825 ( 2001 ), 268\u2013276. Steven H. Strogatz. 2001. Exploring complex networks. Nature 410, 6825 (2001), 268\u2013276."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2772880"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018961"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0186-6"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.066114"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/12\/10\/103018"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.154"},{"key":"e_1_3_2_16_2","volume-title":"Proceedings of the 2011 IEEE Network Science Workshop. IEEE, 188\u2013195","author":"Xie Jierui","unstructured":"Jierui Xie and Boleslaw K. Szymanski . 2011. Community detection using a neighborhood strength driven label propagation algorithm . In Proceedings of the 2011 IEEE Network Science Workshop. IEEE, 188\u2013195 . Jierui Xie and Boleslaw K. Szymanski. 2011. Community detection using a neighborhood strength driven label propagation algorithm. In Proceedings of the 2011 IEEE Network Science Workshop. IEEE, 188\u2013195."},{"key":"e_1_3_2_17_2","volume-title":"Szymanski","author":"Xie Jierui","year":"2012","unstructured":"Jierui Xie and Boleslaw K . Szymanski . 2012 . Towards linear time overlapping community detection in social networks. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer , 25\u201336. Jierui Xie and Boleslaw K. Szymanski. 2012. Towards linear time overlapping community detection in social networks. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 25\u201336."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2871673"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02999-8"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.9981"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921638"},{"key":"e_1_3_2_22_2","volume-title":"Jie Cao and Yong Shi","author":"Li Hui-Jia","year":"2021","unstructured":"Hui-Jia Li , Lin Wang , Zhan Bu , Jie Cao and Yong Shi . 2021 . Measuring the network vulnerability based on Markov criticality. ACM Transactions on Knowledge Discovery from Data 16, 2 (2021), 1\u201324. Hui-Jia Li, Lin Wang, Zhan Bu, Jie Cao and Yong Shi. 2021. Measuring the network vulnerability based on Markov criticality. ACM Transactions on Knowledge Discovery from Data 16, 2 (2021), 1\u201324."},{"key":"e_1_3_2_23_2","volume-title":"Strategic Learning and its Limits. Number 2002 in Arne Ryde Memorial Lectures. Oxford [u.a.]: Oxford Univ","author":"Young H. Peyton","year":"2004","unstructured":"H. Peyton Young . 2004. Strategic Learning and its Limits. Number 2002 in Arne Ryde Memorial Lectures. Oxford [u.a.]: Oxford Univ . Press , 2004 . H. Peyton Young. 2004. Strategic Learning and its Limits. Number 2002 in Arne Ryde Memorial Lectures. Oxford [u.a.]: Oxford Univ. Press, 2004."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr621"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.1938"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/12\/10\/103018"},{"key":"e_1_3_2_28_2","first-page":"58","article-title":"Community detection algorithm based on local similarity of feature vectors","volume":"47","author":"Yang Xuhua","year":"2020","unstructured":"Xuhua Yang and Min Shen . 2020 . Community detection algorithm based on local similarity of feature vectors . Computer Science 47 , 2 (2020), 58 \u2013 64 . Xuhua Yang and Min Shen. 2020. Community detection algorithm based on local similarity of feature vectors. Computer Science 47, 2 (2020), 58\u201364.","journal-title":"Computer Science"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016105"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature09182"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0066005"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1570019"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.233"},{"key":"e_1_3_2_34_2","volume-title":"Proceedings of the 23rd International Conference on World Wide Web. 831\u2013842","author":"Joseph J.","year":"2014","unstructured":"Joseph J. Pfeiffer III, Sebastian Moreno , Timothy La Fond , Jennifer Neville , and Brian Gallagher . 2014 . Attributed graph models: Modeling network structure with correlated attributes . In Proceedings of the 23rd International Conference on World Wide Web. 831\u2013842 . Joseph J. Pfeiffer III, Sebastian Moreno, Timothy La Fond, Jennifer Neville, and Brian Gallagher. 2014. Attributed graph models: Modeling network structure with correlated attributes. In Proceedings of the 23rd International Conference on World Wide Web. 831\u2013842."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2161090"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2012.03.021"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.167"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.01.026"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213894"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-009-9080-2"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2419263"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0186-6"},{"key":"e_1_3_2_43_2","first-page":"49","article-title":"Overlapping community detection with graph neural networks","volume":"50","author":"Shchur Oleksandr","year":"2019","unstructured":"Oleksandr Shchur and Stephan G\u00fcnnemann . 2019 . Overlapping community detection with graph neural networks . Computer Science 50 , 2 (2019), 49 \u2013 62 . Oleksandr Shchur and Stephan G\u00fcnnemann. 2019. Overlapping community detection with graph neural networks. Computer Science 50, 2 (2019), 49\u201362.","journal-title":"Computer Science"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2017.00035"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.01.074"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2892096"},{"key":"e_1_3_2_47_2","first-page":"30","article-title":"Quantification method of classification processes. concept of structural a-entropy","volume":"3","author":"Havrda Jan","year":"1967","unstructured":"Jan Havrda and Franti\u0161ek Charv\u00e1t . 1967 . Quantification method of classification processes. concept of structural a-entropy . Kybernetika 3 , 1 (1967), 30 \u2013 35 . Jan Havrda and Franti\u0161ek Charv\u00e1t. 1967. Quantification method of classification processes. concept of structural a-entropy. Kybernetika 3, 1 (1967), 30\u201335.","journal-title":"Kybernetika"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.016110"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.258701"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2012.699795"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2022.3141598"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2011.2179659"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.07.023"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.056117"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/01\/P01023"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.127103"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:45Z","timestamp":1750182525000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1,31]]}},"alternative-id":["10.1145\/3597436"],"URL":"https:\/\/doi.org\/10.1145\/3597436","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"2021-11-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-08","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}