{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T22:22:41Z","timestamp":1783635761433,"version":"3.55.0"},"reference-count":52,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.knosys.2026.116416","type":"journal-article","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T23:57:16Z","timestamp":1781308636000},"page":"116416","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["DIVCOM: Adaptive graph division for scalable detection of overlapping communities"],"prefix":"10.1016","volume":"348","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2650-6319","authenticated-orcid":false,"given":"Yun","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9933-8014","authenticated-orcid":false,"given":"Wenyu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanglei","family":"Gan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peiyuan","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5342-9896","authenticated-orcid":false,"given":"Yao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.116416_b1","doi-asserted-by":"crossref","unstructured":"Alessandro Epasto, Silvio Lattanzi, Renato Paes Leme, Ego-splitting framework: From non-overlapping to overlapping clusters, in: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2017, pp. 145\u2013154.","DOI":"10.1145\/3097983.3098054"},{"key":"10.1016\/j.knosys.2026.116416_b2","doi-asserted-by":"crossref","unstructured":"Aditya Grover, Jure Leskovec, node2vec: Scalable feature learning for networks, in: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016, pp. 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"10.1016\/j.knosys.2026.116416_b3","doi-asserted-by":"crossref","unstructured":"Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, Xiangyang Lan, Group formation in large social networks: membership, growth, and evolution, in: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006, pp. 44\u201354.","DOI":"10.1145\/1150402.1150412"},{"key":"10.1016\/j.knosys.2026.116416_b4","doi-asserted-by":"crossref","unstructured":"Jaewon Yang, Jure Leskovec, Overlapping community detection at scale: a nonnegative matrix factorization approach, in: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013, pp. 587\u2013596.","DOI":"10.1145\/2433396.2433471"},{"issue":"10","key":"10.1016\/j.knosys.2026.116416_b5","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"1","key":"10.1016\/j.knosys.2026.116416_b6","doi-asserted-by":"crossref","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","article-title":"From louvain to leiden: guaranteeing well-connected communities","volume":"9","author":"Traag","year":"2019","journal-title":"Sci. Rep."},{"key":"10.1016\/j.knosys.2026.116416_b7","doi-asserted-by":"crossref","unstructured":"Daixin Wang, Peng Cui, Wenwu Zhu, Structural deep network embedding, in: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016, pp. 1225\u20131234.","DOI":"10.1145\/2939672.2939753"},{"issue":"1","key":"10.1016\/j.knosys.2026.116416_b8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/TKDE.2020.2981333","article-title":"Deep learning on graphs: A survey","volume":"34","author":"Zhang","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.knosys.2026.116416_b9","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s00778-019-00548-x","article-title":"The ubiquity of large graphs and surprising challenges of graph processing: extended survey: S. Sahu et al.","volume":"29","author":"Sahu","year":"2020","journal-title":"VLDB J."},{"issue":"1","key":"10.1016\/j.knosys.2026.116416_b10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/TPDS.2015.2390633","article-title":"Engineering parallel algorithms for community detection in massive networks","volume":"27","author":"Staudt","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.knosys.2026.116416_b11","article-title":"Understanding regularized spectral clustering via graph conductance","volume":"31","author":"Zhang","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.knosys.2026.116416_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115956","article-title":"Parallel and distributed paradigms for community detection in social networks: A methodological review","volume":"187","author":"Naik","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"10.1016\/j.knosys.2026.116416_b13","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.90.062805","article-title":"Community detection in networks: Structural communities versus ground truth","volume":"90","author":"Hric","year":"2014","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.knosys.2026.116416_b14","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.physa.2017.09.023","article-title":"Adaptive multi-resolution modularity for detecting communities in networks","volume":"491","author":"Chen","year":"2018","journal-title":"Phys. A"},{"issue":"4","key":"10.1016\/j.knosys.2026.116416_b15","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","author":"Rosvall","year":"2008","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"8","key":"10.1016\/j.knosys.2026.116416_b16","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"10.1016\/j.knosys.2026.116416_b17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"Von Luxburg","year":"2007","journal-title":"Stat. Comput."},{"key":"10.1016\/j.knosys.2026.116416_b18","series-title":"2025 IEEE International Conference on Quantum Artificial Intelligence","first-page":"55","article-title":"Hybrid quantum-classical walks for graph representation learning in community detection","author":"Mar\u00edn","year":"2025"},{"key":"10.1016\/j.knosys.2026.116416_b19","series-title":"2011 Ieee 11th International Conference on Data Mining Workshops","first-page":"344","article-title":"Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process","author":"Xie","year":"2011"},{"issue":"1","key":"10.1016\/j.knosys.2026.116416_b20","doi-asserted-by":"crossref","first-page":"11054","DOI":"10.1038\/s41598-022-15095-9","article-title":"Detecting overlapping communities in complex networks using non-cooperative games","volume":"12","author":"Ferdowsi","year":"2022","journal-title":"Sci. Rep."},{"key":"10.1016\/j.knosys.2026.116416_b21","doi-asserted-by":"crossref","unstructured":"Michele Coscia, Giulio Rossetti, Fosca Giannotti, Dino Pedreschi, Demon: a local-first discovery method for overlapping communities, in: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012, pp. 615\u2013623.","DOI":"10.1145\/2339530.2339630"},{"key":"10.1016\/j.knosys.2026.116416_b22","series-title":"Detecting highly overlapping community structure by greedy clique expansion","author":"Lee","year":"2010"},{"key":"10.1016\/j.knosys.2026.116416_b23","series-title":"2012 IEEE 12th International Conference on Data Mining","first-page":"1170","article-title":"Community-affiliation graph model for overlapping network community detection","author":"Yang","year":"2012"},{"issue":"7043","key":"10.1016\/j.knosys.2026.116416_b24","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","article-title":"Uncovering the overlapping community structure of complex networks in nature and society","volume":"435","author":"Palla","year":"2005","journal-title":"Nature"},{"key":"10.1016\/j.knosys.2026.116416_b25","doi-asserted-by":"crossref","unstructured":"Sandro Cavallari, Vincent W Zheng, Hongyun Cai, Kevin Chen-Chuan Chang, Erik Cambria, Learning community embedding with community detection and node embedding on graphs, in: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017, pp. 377\u2013386.","DOI":"10.1145\/3132847.3132925"},{"key":"10.1016\/j.knosys.2026.116416_b26","doi-asserted-by":"crossref","unstructured":"Yuting Jia, Qinqin Zhang, Weinan Zhang, Xinbing Wang, Communitygan: Community detection with generative adversarial nets, in: The World Wide Web Conference, 2019, pp. 784\u2013794.","DOI":"10.1145\/3308558.3313564"},{"key":"10.1016\/j.knosys.2026.116416_b27","series-title":"2018 IEEE International Conference on Data Mining","first-page":"869","article-title":"Semi-supervised community detection using structure and size","author":"Bakshi","year":"2018"},{"key":"10.1016\/j.knosys.2026.116416_b28","doi-asserted-by":"crossref","unstructured":"Yao Zhang, Yun Xiong, Yun Ye, Tengfei Liu, Weiqiang Wang, Yangyong Zhu, Philip S Yu, SEAL: Learning heuristics for community detection with generative adversarial networks, in: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2020, pp. 1103\u20131113.","DOI":"10.1145\/3394486.3403154"},{"key":"10.1016\/j.knosys.2026.116416_b29","series-title":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","first-page":"2059","article-title":"CLARE: A semi-supervised community detection algorithm","author":"Wu","year":"2022"},{"key":"10.1016\/j.knosys.2026.116416_b30","doi-asserted-by":"crossref","unstructured":"Xixi Wu, Kaiyu Xiong, Yun Xiong, Xiaoxin He, Yao Zhang, Yizhu Jiao, Jiawei Zhang, Procom: A few-shot targeted community detection algorithm, in: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024, pp. 3414\u20133424.","DOI":"10.1145\/3637528.3671749"},{"issue":"6","key":"10.1016\/j.knosys.2026.116416_b31","doi-asserted-by":"crossref","first-page":"388","DOI":"10.9734\/jerr\/2024\/v26i61188","article-title":"Hyperparameter tuning in machine learning: A comprehensive review","volume":"26","author":"Ilemobayo","year":"2024","journal-title":"J. Eng. Res. Rep."},{"key":"10.1016\/j.knosys.2026.116416_b32","article-title":"Centrality-aware collaborative network embedding for overlapping community detection","author":"Cheng","year":"2025","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.knosys.2026.116416_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119213","article-title":"Overlapping community detection with adaptive density peaks clustering and iterative partition strategy","volume":"213","author":"Niu","year":"2023","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"10.1016\/j.knosys.2026.116416_b34","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1109\/TCSS.2020.3008860","article-title":"Sparse nonnegative matrix factorization for multiple-local-community detection","volume":"7","author":"Kamuhanda","year":"2020","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"11","key":"10.1016\/j.knosys.2026.116416_b35","doi-asserted-by":"crossref","first-page":"6737","DOI":"10.1109\/TNNLS.2021.3083318","article-title":"Self-training enhanced: Network embedding and overlapping community detection with adversarial learning","volume":"33","author":"Chen","year":"2021","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.knosys.2026.116416_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.108542","article-title":"PMCDM: Privacy-preserving multiresolution community detection in multiplex networks","volume":"244","author":"Shao","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.knosys.2026.116416_b37","doi-asserted-by":"crossref","DOI":"10.1109\/TVT.2025.3585176","article-title":"Differential privacy decentralized federated learning for internet of vehicles over time-varying unbalanced networks","author":"Zhao","year":"2025","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"3\u20135","key":"10.1016\/j.knosys.2026.116416_b38","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"key":"10.1016\/j.knosys.2026.116416_b39","doi-asserted-by":"crossref","unstructured":"Nate Veldt, David F. Gleich, Anthony Wirth, A correlation clustering framework for community detection, in: Proceedings of the 2018 World Wide Web Conference, 2018, pp. 439\u2013448.","DOI":"10.1145\/3178876.3186110"},{"key":"10.1016\/j.knosys.2026.116416_b40","doi-asserted-by":"crossref","DOI":"10.1016\/j.csda.2023.107794","article-title":"A distributed community detection algorithm for large scale networks under stochastic block models","volume":"187","author":"Wu","year":"2023","journal-title":"Comput. Statist. Data Anal."},{"key":"10.1016\/j.knosys.2026.116416_b41","series-title":"International Conference on Complex Networks and their Applications","first-page":"209","article-title":"Mosaic benchmark networks: Modular link streams for testing dynamic community detection algorithms","author":"Asgari","year":"2023"},{"key":"10.1016\/j.knosys.2026.116416_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115773","article-title":"A distributed model for sampling large scale social networks","volume":"186","author":"Jaouadi","year":"2021","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"10.1016\/j.knosys.2026.116416_b43","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MC.2015.74","article-title":"In-memory graph databases for web-scale data","volume":"48","author":"Castellana","year":"2015","journal-title":"Computer"},{"issue":"3","key":"10.1016\/j.knosys.2026.116416_b44","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","author":"Raghavan","year":"2007","journal-title":"Phys. Rev. E\u2014Statistical, Nonlinear, Soft Matter Phys."},{"issue":"10","key":"10.1016\/j.knosys.2026.116416_b45","doi-asserted-by":"crossref","DOI":"10.1088\/1367-2630\/12\/10\/103018","article-title":"Finding overlapping communities in networks by label propagation","volume":"12","author":"Gregory","year":"2010","journal-title":"New J. Phys."},{"issue":"4","key":"10.1016\/j.knosys.2026.116416_b46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2501654.2501657","article-title":"Overlapping community detection in networks: The state-of-the-art and comparative study","volume":"45","author":"Xie","year":"2013","journal-title":"Acm Comput. Surv. (Csur)"},{"issue":"6","key":"10.1016\/j.knosys.2026.116416_b47","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/0047-2484(92)90081-J","article-title":"Neocortex size as a constraint on group size in primates","volume":"22","author":"Dunbar","year":"1992","journal-title":"J. Hum. Evol."},{"issue":"1","key":"10.1016\/j.knosys.2026.116416_b48","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","article-title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters","volume":"6","author":"Leskovec","year":"2009","journal-title":"Internet Math."},{"issue":"8","key":"10.1016\/j.knosys.2026.116416_b49","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1073\/pnas.1424644112","article-title":"Toward link predictability of complex networks","volume":"112","author":"L\u00fc","year":"2015","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"10.1016\/j.knosys.2026.116416_b50","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","author":"Adamic","year":"2003","journal-title":"Soc. Netw."},{"issue":"1","key":"10.1016\/j.knosys.2026.116416_b51","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.80.016118","article-title":"Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities","volume":"80","author":"Lancichinetti","year":"2009","journal-title":"Phys. Rev. E\u2014Statistical, Nonlinear, Soft Matter Phys."},{"key":"10.1016\/j.knosys.2026.116416_b52","series-title":"A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices","first-page":"1","author":"Karypis","year":"1998"}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126011421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126011421?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T22:07:35Z","timestamp":1783634855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126011421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":52,"alternative-id":["S0950705126011421"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116416","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"DIVCOM: Adaptive graph division for scalable detection of overlapping communities","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116416","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116416"}}