{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:32Z","timestamp":1750220792399,"version":"3.41.0"},"reference-count":65,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T00:00:00Z","timestamp":1587081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61876128, 61772361 and 61902278"],"award-info":[{"award-number":["61876128, 61772361 and 61902278"]}],"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. Intell. Syst. Technol."],"published-print":{"date-parts":[[2020,6,30]]},"abstract":"<jats:p>\n            Overlapping community detection has triggered recent research in network analysis. One of the promising techniques for finding overlapping communities is the popular stochastic models, which, unfortunately, have some common drawbacks. They do not support an important observation that highly connected nodes are more likely to reside in the overlapping regions of communities in the network. These methods are in essence not truly unsupervised, since they require a threshold on probabilistic memberships to derive overlapping structures and need the number of communities to be specified\n            <jats:italic>a priori<\/jats:italic>\n            . We develop a new method to address these issues for overlapping community detection. We first present a stochastic model to accommodate the relative importance and the expected degree of every node in each community. We then infer every overlapping community by ranking the nodes according to their importance. Second, we determine the number of communities under the Bayesian framework. We evaluate our method and compare it with five state-of-the-art methods. The results demonstrate the superior performance of our method. We also apply this new method to two applications, showing its superb performance on practical problems.\n          <\/jats:p>","DOI":"10.1145\/3373760","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T07:06:58Z","timestamp":1588576018000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Modeling with Node Popularities for Autonomous Overlapping Community Detection"],"prefix":"10.1145","volume":"11","author":[{"given":"Di","family":"Jin","sequence":"first","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5000-7575","authenticated-orcid":false,"given":"Bingyi","family":"Li","sequence":"additional","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University, China"}]},{"given":"Pengfei","family":"Jiao","sequence":"additional","affiliation":[{"name":"College of Intelligence and Computing, Center of Biosafety Research and Strategy, Tianjin University, China"}]},{"given":"Dongxiao","family":"He","sequence":"additional","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University, China"}]},{"given":"Hongyu","family":"Shan","sequence":"additional","affiliation":[{"name":"College of Intelligence and Computing, Tianjin University, China"}]},{"given":"Weixiong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, Missouri"}]}],"member":"320","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature09182"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442798"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/75556"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.036103"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.06.015"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.08.033"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0155320"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1142\/S2425038416300019"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"C. Felbaum. 1998. Wordnet an Electronic Lexical Database for English.  C. Felbaum. 1998. Wordnet an Electronic Lexical Database for English.","DOI":"10.7551\/mitpress\/7287.001.0001"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1221839110"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/12\/10\/103018"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/apr.2017.18"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'15)","author":"He Dongxiao","year":"2015","unstructured":"Dongxiao He , Dayou Liu , Di Jin , and Weixiong Zhang . 2015 . A Stochastic Model for Detecting Heterogeneous Link Communities in Complex Networks . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'15) . 130--136. Dongxiao He, Dayou Liu, Di Jin, and Weixiong Zhang. 2015. A Stochastic Model for Detecting Heterogeneous Link Communities in Complex Networks. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'15). 130--136."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.11.055"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201915)","author":"Jin Di","year":"2015","unstructured":"Di Jin , Zheng Chen , Dongxiao He , and Weixiong Zhang . 2015 . Modeling with node degree preservation can accurately find communities . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201915) . 160--167. Di Jin, Zheng Chen, Dongxiao He, and Weixiong Zhang. 2015. Modeling with node degree preservation can accurately find communities. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201915). 160--167."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30493-5_55"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201916)","author":"Jin Di","year":"2016","unstructured":"Di Jin , Hongcui Wang , Jianwu Dang , Dongxiao He , and Weixiong Zhang . 2016 . Detect overlapping communities via ranking node popularities . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201916) . 172--178. Di Jin, Hongcui Wang, Jianwu Dang, Dongxiao He, and Weixiong Zhang. 2016. Detect overlapping communities via ranking node popularities. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201916). 172--178."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'18)","author":"Jin Di","year":"2018","unstructured":"Di Jin , Xiaobao Wang , Ruifang He , Dongxiao He , Jianwu Dang , and Weixiong Zhang . 2018 . Robust detection of link communities in large social networks by exploiting link semantics. 2018 . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'18) . 314--321. Di Jin, Xiaobao Wang, Ruifang He, Dongxiao He, Jianwu Dang, and Weixiong Zhang. 2018. Robust detection of link communities in large social networks by exploiting link semantics. 2018. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'18). 314--321."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/05\/P05031"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1312486110"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.016118"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018961"},{"key":"e_1_2_1_29_1","unstructured":"Daniel D. Lee and H. Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems. 556--562.  Daniel D. Lee and H. Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems. 556--562."},{"key":"e_1_2_1_30_1","volume-title":"SNAP: Stanford network analysis project. https:\/\/snap.stanford.edu.","author":"Leskovec Jure","year":"2014","unstructured":"Jure Leskovec and Andrej Krevl . 2014 . SNAP: Stanford network analysis project. https:\/\/snap.stanford.edu. Jure Leskovec and Andrej Krevl. 2014. SNAP: Stanford network analysis project. https:\/\/snap.stanford.edu."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772755"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2853115"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Ye Li Chaofeng Sha Xin Huang and Yanchun Zhang. 2018. Community detection in attributed graphs: An embedding approach. (2018).  Ye Li Chaofeng Sha Xin Huang and Yanchun Zhang. 2018. Community detection in attributed graphs: An embedding approach. (2018).","DOI":"10.1609\/aaai.v32i1.11274"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.09.028"},{"key":"e_1_2_1_35_1","first-page":"5982","article-title":"Community detection in complex networks via clique conductance. Sci","volume":"8","author":"Lu Zhenqi","year":"2018","unstructured":"Zhenqi Lu , Johan Wahlstr\u00f6m , and Arye Nehorai . 2018 . Community detection in complex networks via clique conductance. Sci . Rep. 8 , 1 (2018), 5982 . Zhenqi Lu, Johan Wahlstr\u00f6m, and Arye Nehorai. 2018. Community detection in complex networks via clique conductance. Sci. Rep. 8, 1 (2018), 5982.","journal-title":"Rep."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2016.2634322"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.3758\/BF03195588"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys2162"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_2_1_40_1","volume-title":"Heard","author":"Passino Francesco Sanna","year":"2019","unstructured":"Francesco Sanna Passino and Nicholas A . Heard . 2019 . Bayesian estimation of the latent dimension and communities in stochastic blockmodels. arXiv preprint arXiv:1904.05333 (2019). Francesco Sanna Passino and Nicholas A. Heard. 2019. Bayesian estimation of the latent dimension and communities in stochastic blockmodels. arXiv preprint arXiv:1904.05333 (2019)."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1211"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832415.2832538"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517088"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.066114"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2017.12.003"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2008.12.021"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.056111"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12087"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.6.011036"},{"key":"e_1_2_1_51_1","first-page":"1","article-title":"Local network community detection with continuous optimization of conductance and weighted kernel k-means","volume":"17","author":"Laarhoven Twan Van","year":"2016","unstructured":"Twan Van Laarhoven and Elena Marchiori . 2016 . Local network community detection with continuous optimization of conductance and weighted kernel k-means . J. Mach. Learn. Res. 17 , 147 (2016), 1 -- 28 . Twan Van Laarhoven and Elena Marchiori. 2016. Local network community detection with continuous optimization of conductance and weighted kernel k-means. J. Mach. Learn. Res. 17, 147 (2016), 1--28.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2892096"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201917)","author":"Wang Xiao","year":"2017","unstructured":"Xiao Wang , Peng Cui , Jing Wang , Jian Pei , Wenwu Zhu , and Shiqiang Yang . 2017 . Community preserving network embedding . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201917) . 203--209. Xiao Wang, Peng Cui, Jing Wang, Jian Pei, Wenwu Zhu, and Shiqiang Yang. 2017. Community preserving network embedding. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201917). 203--209."},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201916)","author":"Wang Xiao","year":"2016","unstructured":"Xiao Wang , Di Jin , Xiaochun Cao , Liang Yang , and Weixiong Zhang . 2016 . Semantic community identification in large attribute networks . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201916) . 265--271. Xiao Wang, Di Jin, Xiaochun Cao, Liang Yang, and Weixiong Zhang. 2016. Semantic community identification in large attribute networks. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201916). 265--271."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2518687"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/28.1.289"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"e_1_2_1_58_1","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--36. 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--36."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.154"},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'15)","author":"Yang Bo","year":"2015","unstructured":"Bo Yang , Xuehua Hao , and Xueyan Liu . 2015 . Bayesian approach to modeling and detecting communities in signed network . In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'15) . 1952--1958. Bo Yang, Xuehua Hao, and Xueyan Liu. 2015. Bayesian approach to modeling and detecting communities in signed network. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI'15). 1952--1958."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433471"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594454"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339629"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330721"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:47Z","timestamp":1750200107000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,17]]},"references-count":65,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6,30]]}},"alternative-id":["10.1145\/3373760"],"URL":"https:\/\/doi.org\/10.1145\/3373760","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2020,4,17]]},"assertion":[{"value":"2018-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}