{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:45:57Z","timestamp":1765889157933,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T00:00:00Z","timestamp":1692662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T00:00:00Z","timestamp":1692662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the National Key R&D Program of China","award":["2019YFB1704100","2019YFB1704100","2019YFB1704100"],"award-info":[{"award-number":["2019YFB1704100","2019YFB1704100","2019YFB1704100"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62072337","62072337","62072337"],"award-info":[{"award-number":["62072337","62072337","62072337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the National Social Science Foundation of China","award":["17BTQ086","17BTQ086","17BTQ086"],"award-info":[{"award-number":["17BTQ086","17BTQ086","17BTQ086"]}]},{"name":"the Subproject of National Seafloor Observatory System of China","award":["2970000001\/001\/016","2970000001\/001\/016","2970000001\/001\/016"],"award-info":[{"award-number":["2970000001\/001\/016","2970000001\/001\/016","2970000001\/001\/016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11227-023-05572-x","type":"journal-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T07:02:12Z","timestamp":1692687732000},"page":"2838-2861","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A big graph clustering method to support parallel processing by perceiving graph\u2019s application algorithm semantics"],"prefix":"10.1007","volume":"80","author":[{"given":"Tengteng","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guosun","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,22]]},"reference":[{"key":"5572_CR1","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D et al (2012) PowerGraph: distributed graph-parallel computation on natural graphs. In: 10th USENIX symposium on operating systems design and implementation, p 17\u201330"},{"key":"5572_CR2","doi-asserted-by":"publisher","unstructured":"Malewicz G, Austern MH, Bik AJ et al (2010) Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, p135\u2013146. https:\/\/doi.org\/10.1145\/1582716.1582723","DOI":"10.1145\/1582716.1582723"},{"key":"5572_CR3","doi-asserted-by":"publisher","unstructured":"Xin RS, Gonzalez JE, Franklin MJ et al (2013) Graphx: a resilient distributed graph system on spark. In: First international workshop on graph data management experiences and systems, p 1\u20136. https:\/\/doi.org\/10.1145\/2484425.2484427","DOI":"10.1145\/2484425.2484427"},{"issue":"2","key":"5572_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):1\u201316. https:\/\/doi.org\/10.1103\/PhysRevE.69.026113","journal-title":"Phys Rev E"},{"issue":"2","key":"5572_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","volume":"38","author":"M Barthelemy","year":"2004","unstructured":"Barthelemy M (2004) Betweenness centrality in large complex networks. Eur Phys J B 38(2):163\u2013168. https:\/\/doi.org\/10.1140\/epjb\/e2004-00111-4","journal-title":"Eur Phys J B"},{"key":"5572_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jnca.2018.02.011","volume":"108","author":"MA Javed","year":"2018","unstructured":"Javed MA, Younis MS, Latif S et al (2018) Community detection in networks: a multidisciplinary review. J Netw Comput Appl 108:87\u2013111. https:\/\/doi.org\/10.1016\/j.jnca.2018.02.011","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"5572_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/TAI.2021.3065894","volume":"2","author":"G Chao","year":"2021","unstructured":"Chao G, Sun S, Bi J (2021) A survey on multiview clustering. IEEE Trans Artif Intell 2(2):146\u2013168. https:\/\/doi.org\/10.1109\/TAI.2021.3065894","journal-title":"IEEE Trans Artif Intell"},{"issue":"2","key":"5572_CR8","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1145\/2522968.2522981","volume":"54","author":"A Zubaro\u011flu","year":"2021","unstructured":"Zubaro\u011flu A, Atalay V (2021) Data stream clustering: a review. Artif Intell Rev 54(2):1201\u20131236. https:\/\/doi.org\/10.1145\/2522968.2522981","journal-title":"Artif Intell Rev"},{"issue":"2","key":"5572_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1080\/01972240590925348","volume":"21","author":"JR Tyler","year":"2005","unstructured":"Tyler JR, Wilkinson DM et al (2005) Email as spectroscopy: automated discovery of community structure within organizations. Inf Soc 21(2):143\u2013153. https:\/\/doi.org\/10.1080\/01972240590925348","journal-title":"Inf Soc"},{"key":"5572_CR10","doi-asserted-by":"publisher","unstructured":"Rattigan MJ, Maier M et al (2007) Graph clustering with network structure indices. In: Proceedings of the 24th international conference on machine learning, p 783\u2013790. https:\/\/doi.org\/10.1145\/1273496.1273595","DOI":"10.1145\/1273496.1273595"},{"key":"5572_CR11","doi-asserted-by":"publisher","unstructured":"Dhulipala L, Eisenstat D, \u0141\u0105cki J et al (2021) Hierarchical agglomerative graph clustering in nearly-linear time. In: International conference on machine learning, p 2676\u20132686. https:\/\/doi.org\/10.48550\/arXiv.2106.05610","DOI":"10.48550\/arXiv.2106.05610"},{"key":"5572_CR12","doi-asserted-by":"publisher","unstructured":"Dasgupta S (2016) A cost function for similarity-based hierarchical clustering. In: Proceedings of the forty-eighth annual ACM symposium on theory of computing, p 118\u2013127. https:\/\/doi.org\/10.48550\/arXiv.1510.05043","DOI":"10.48550\/arXiv.1510.05043"},{"issue":"11","key":"5572_CR13","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","volume":"28","author":"P Franti","year":"2006","unstructured":"Franti P, Virmajoki O, Hautamaki V (2006) Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans Pattern Anal Mach Intell 28(11):1875\u20131881. https:\/\/doi.org\/10.1109\/TPAMI.2006.227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"5572_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.23974\/ijol.2019.vol4.1.106","volume":"4","author":"C Tao","year":"2019","unstructured":"Tao C, Shan R, Li H et al (2019) An agglomerative-adapted partition approach for large-scale graphs. Int J Librariansh 4(1):3\u201318. https:\/\/doi.org\/10.23974\/ijol.2019.vol4.1.106","journal-title":"Int J Librariansh"},{"issue":"6","key":"5572_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69(6):1\u20135. https:\/\/doi.org\/10.1103\/PhysRevE.69.066133","journal-title":"Phys Rev E"},{"issue":"1","key":"5572_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato S, Barth\u00e9lemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36\u201341. https:\/\/doi.org\/10.1073\/pnas.0605965104","journal-title":"Proc Natl Acad Sci"},{"key":"5572_CR17","doi-asserted-by":"publisher","unstructured":"Duan L, Street WN, Liu Y, Lu H (2014) Community detection in graphs through correlation. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, p 1376\u20131385. https:\/\/doi.org\/10.1145\/2623330.2623629","DOI":"10.1145\/2623330.2623629"},{"key":"5572_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ins.2019.10.076","volume":"513","author":"J Zhu","year":"2020","unstructured":"Zhu J, Chen B et al (2020) Community detection based on modularity and k-plexes. Inf Sci 513:127\u2013142. https:\/\/doi.org\/10.1016\/j.ins.2019.10.076","journal-title":"Inf Sci"},{"issue":"7","key":"5572_CR19","first-page":"1975","volume":"34","author":"Y Wang","year":"2017","unstructured":"Wang Y, He W, Shi J (2017) Community detection algorithm based on community density. Appl Res Comput 34(7):1975\u20131979","journal-title":"Appl Res Comput"},{"issue":"10","key":"5572_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL et al (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008(10):1\u201312. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J Stat Mech: Theory Exp"},{"key":"5572_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/HPEC.2014.7040973","volume":"2014","author":"C Wickramaarachchi","year":"2014","unstructured":"Wickramaarachchi C, Frincu M, Small P et al (2014) Fast parallel algorithm for unfolding of communities in large graphs. IEEE High Perform Extrem Comput Conf 2014:1\u20136. https:\/\/doi.org\/10.1109\/HPEC.2014.7040973","journal-title":"IEEE High Perform Extrem Comput Conf"},{"issue":"3","key":"5572_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3385415","volume":"14","author":"H Sun","year":"2020","unstructured":"Sun H, He F, Huang J et al (2020) Network embedding for community detection in attributed networks. ACM Trans Knowl Discov Data 14(3):1\u201325. https:\/\/doi.org\/10.1145\/3385415","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"2","key":"5572_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.26421\/JDI1.2-1","volume":"1","author":"H Shiokawa","year":"2019","unstructured":"Shiokawa H, Futamura Y (2019) Efficient vector partitioning algorithms for modularity-based graph clustering. J Data Intell 1(2):101\u2013123","journal-title":"J Data Intell"},{"issue":"6","key":"5572_CR24","doi-asserted-by":"publisher","first-page":"6056","DOI":"10.1007\/s11227-020-03510-9","volume":"77","author":"M Mohammadi","year":"2021","unstructured":"Mohammadi M, Fazlali M, Hosseinzadeh M (2021) Accelerating Louvain community detection algorithm on graphic processing unit. J Supercomput 77(6):6056\u20136077. https:\/\/doi.org\/10.1007\/s11227-020-03510-9","journal-title":"J Supercomput"},{"key":"5572_CR25","doi-asserted-by":"publisher","unstructured":"Ghosh S, Halappanavar M, Tumeo A et al (2019) Scaling and quality of modularity optimization methods for graph clustering. In: IEEE high performance extreme computing conference, p 1\u20136. https:\/\/doi.org\/10.1109\/HPEC.2019.8916299","DOI":"10.1109\/HPEC.2019.8916299"},{"issue":"3","key":"5572_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):1\u201311. https:\/\/doi.org\/10.1103\/PhysRevE.76.036106","journal-title":"Phys Rev E"},{"key":"5572_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.113020","volume":"162","author":"IB El Kouni","year":"2020","unstructured":"El Kouni IB, Karoui W, Romdhane LB (2020) Node importance-based label propagation algorithm for overlapping community detection in networks. Expert Syst Appl 162:1\u201313. https:\/\/doi.org\/10.1016\/j.eswa.2019.113020","journal-title":"Expert Syst Appl"},{"issue":"9","key":"5572_CR28","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1109\/TKDE.2018.2866424","volume":"31","author":"M Lu","year":"2018","unstructured":"Lu M, Zhang Z et al (2018) LPANNI: Overlapping community detection using label propagation in large-scale complex networks. IEEE Trans Knowl Data Eng 31(9):1736\u20131749. https:\/\/doi.org\/10.1109\/TKDE.2018.2866424","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"5572_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-99","volume":"10","author":"J Vlasblom","year":"2009","unstructured":"Vlasblom J, Wodak SJ (2009) Markov clustering versus affinity propagation for the partitioning of protein interaction graphs. BMC Bioinf 10(1):1\u201314. https:\/\/doi.org\/10.1186\/1471-2105-10-99","journal-title":"BMC Bioinf"},{"issue":"4","key":"5572_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0018209","volume":"6","author":"M Rosvall","year":"2011","unstructured":"Rosvall M, Bergstrom CT (2011) Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PLoS ONE 6(4):1\u201310. https:\/\/doi.org\/10.1371\/journal.pone.0018209","journal-title":"PLoS ONE"},{"issue":"1","key":"5572_CR31","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1109\/TPAMI.2019.2926033","volume":"43","author":"M Okuda","year":"2019","unstructured":"Okuda M, Satoh SI et al (2019) Community detection using restrained random-walk similarity. IEEE Trans Pattern Anal Mach Intell 43(1):89\u2013103. https:\/\/doi.org\/10.1109\/TPAMI.2019.2926033","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"5572_CR32","doi-asserted-by":"publisher","first-page":"395","DOI":"10.48550\/arXiv.0711.0189","volume":"17","author":"UV Luxburg","year":"2007","unstructured":"Luxburg UV (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416. https:\/\/doi.org\/10.48550\/arXiv.0711.0189","journal-title":"Stat Comput"},{"key":"5572_CR33","doi-asserted-by":"publisher","unstructured":"Deng CH, Zhao WL (2018) Fast k-means based on k-nn graph. In: 2018 IEEE 34th international conference on data engineering, p 1220\u20131223. https:\/\/doi.org\/10.1109\/ICDE.2018.00115","DOI":"10.1109\/ICDE.2018.00115"},{"issue":"1","key":"5572_CR34","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TBDATA.2019.2931532","volume":"8","author":"T Li","year":"2022","unstructured":"Li T, Zhang Y et al (2022) Fast compressive spectral clustering for large-scale sparse graph. IEEE Trans Big Data 8(1):193\u2013202. https:\/\/doi.org\/10.1109\/TBDATA.2019.2931532","journal-title":"IEEE Trans Big Data"},{"issue":"5980","key":"5572_CR35","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1126\/science.1184819","volume":"328","author":"PJ Mucha","year":"2010","unstructured":"Mucha PJ, Richardson T et al (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science 328(5980):876\u2013878. https:\/\/doi.org\/10.1126\/science.1184819","journal-title":"Science"},{"issue":"4\u20136","key":"5572_CR36","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(00)00142-3","volume":"76","author":"E Hartuv","year":"2000","unstructured":"Hartuv E, Shamir R (2000) A clustering algorithm based on graph connectivity. Inf Process Lett 76(4\u20136):175\u2013181. https:\/\/doi.org\/10.1016\/S0020-0190(00)00142-3","journal-title":"Inf Process Lett"},{"issue":"3","key":"5572_CR37","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.989932","volume":"35","author":"GW Flake","year":"2002","unstructured":"Flake GW, Lawrence S, Giles CL et al (2002) Self-organization and identification of web communities. Computer 35(3):66\u201370. https:\/\/doi.org\/10.1109\/2.989932","journal-title":"Computer"},{"key":"5572_CR38","doi-asserted-by":"publisher","first-page":"77070","DOI":"10.1109\/ACCESS.2019.2921477","volume":"7","author":"K Hu","year":"2019","unstructured":"Hu K, Zeng G, Ding S et al (2019) Cluster-scheduling big graph traversal task for parallel processing in heterogeneous cloud based on DAG transformation. IEEE Access 7:77070\u201377082. https:\/\/doi.org\/10.1109\/ACCESS.2019.2921477","journal-title":"IEEE Access"},{"key":"5572_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.future.2017.06.027","volume":"80","author":"K Hu","year":"2018","unstructured":"Hu K, Zeng G et al (2018) Partitioning big graph with respect to arbitrary proportions in a streaming manner. Futur Gener Comput Syst 80:1\u201311.\u00a0https:\/\/doi.org\/10.1016\/j.future.2017.06.027","journal-title":"Futur Gener Comput Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05572-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05572-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05572-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T09:37:15Z","timestamp":1705311435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05572-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,22]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5572"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05572-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2023,8,22]]},"assertion":[{"value":"3 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}