{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:12:44Z","timestamp":1776435164470,"version":"3.51.2"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"The National Social Science Fund of China","award":["18BGL266"],"award-info":[{"award-number":["18BGL266"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["41571401"],"award-info":[{"award-number":["41571401"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00500-023-08067-2","type":"journal-article","created":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T05:02:17Z","timestamp":1683349337000},"page":"13689-13700","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Overlapping community detection algorithm based on similarity of node relationship"],"prefix":"10.1007","volume":"27","author":[{"given":"Hongtao","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1597-6471","authenticated-orcid":false,"given":"Ning","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,6]]},"reference":[{"key":"8067_CR1","doi-asserted-by":"crossref","unstructured":"Coscia M, Rossetti G, Giannotti F, et al. (2012) Demon: a local-first discovery method for overlapping communities. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. 615\u2013623.","DOI":"10.1145\/2339530.2339630"},{"issue":"09","key":"8067_CR2","doi-asserted-by":"publisher","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon L, Diaz-Guilera A, Duch J et al (2005) Comparing community structure identification. J Stat Mech: Theory Exp 2005(09):P09008","journal-title":"J Stat Mech: Theory Exp"},{"key":"8067_CR3","first-page":"23","volume":"21","author":"W Gang","year":"2018","unstructured":"Gang W (2018) Overlapping community discovery algorithm based on edge propagation probability. Comp Knowl Technol 21:23","journal-title":"Comp Knowl Technol"},{"issue":"12","key":"8067_CR4","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"issue":"10","key":"8067_CR5","doi-asserted-by":"publisher","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory S (2010) Finding overlapping communities in networks by label propagation. New J Phys 12(10):103018","journal-title":"New J Phys"},{"key":"8067_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","journal-title":"J Netw Comput Appl"},{"issue":"6","key":"8067_CR7","first-page":"1376","volume":"53","author":"C Junyu","year":"2016","unstructured":"Junyu C, Gang Z, Nan Yu et al (2016) A semi-supervised locally extended overlapping community discovery method. Comput Res Dev 53(6):1376","journal-title":"Comput Res Dev"},{"key":"8067_CR8","unstructured":"Krebs V. Books About US Politics.[Online].Available:http:\/\/www.orgnet.com\/,2004."},{"key":"8067_CR9","first-page":"693","volume":"08","author":"G Kun","year":"2018","unstructured":"Kun G, Erbao C, Wenzhong G (2018) Overlapping community discovery algorithm based on edge density clustering. Pattern Recognit Artif Intell 08:693\u2013703","journal-title":"Pattern Recognit Artif Intell"},{"issue":"4","key":"8067_CR10","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms[J]. Phys Rev E 78(4):046110","journal-title":"Phys Rev E"},{"issue":"3","key":"8067_CR11","doi-asserted-by":"publisher","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","volume":"11","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti A, Fortunato S, Kert\u00e9sz J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New J Phys 11(3):033015","journal-title":"New J Phys"},{"issue":"7","key":"8067_CR12","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1109\/TCYB.2017.2720180","volume":"48","author":"Z Li","year":"2017","unstructured":"Li Z, Liu J, Wu K (2017) A multiobjective evolutionary algorithm based onstructural and attribute similarities for community detection in attributednetworks. IEEE Trans Cybern 48(7):1963\u20131976","journal-title":"IEEE Trans Cybern"},{"issue":"9","key":"8067_CR13","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, Qu 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","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"8067_CR15","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Physica A 390(6):1150\u20131170","journal-title":"Physica A"},{"issue":"4","key":"8067_CR16","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau D, Schneider K, Boisseau OJ et al (2003) The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4):396\u2013405","journal-title":"Behav Ecol Sociobiol"},{"issue":"7043","key":"8067_CR17","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Der\u00e9nyi I, Farkas I et al (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818","journal-title":"Nature"},{"issue":"6","key":"8067_CR18","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1088\/1367-2630\/9\/6\/186","volume":"9","author":"G Palla","year":"2007","unstructured":"Palla G, Farkas IJ, Pollner P et al (2007) Directed network modules. New J Phys 9(6):186","journal-title":"New J Phys"},{"issue":"9","key":"8067_CR19","doi-asserted-by":"publisher","first-page":"2658","DOI":"10.1073\/pnas.0400054101","volume":"101","author":"F Radicchi","year":"2004","unstructured":"Radicchi F, Castellano C, Cecconi F et al (2004) Defining and identifying communities in networks. Proc Natl Acad Sci 101(9):2658\u20132663","journal-title":"Proc Natl Acad Sci"},{"issue":"3","key":"8067_CR20","doi-asserted-by":"publisher","first-page":"036106","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):036106","journal-title":"Phys Rev E"},{"key":"8067_CR21","doi-asserted-by":"crossref","unstructured":"Ruan Y, Fuhry D, Parthasarathy S, (2013) Efficient community detection in large networks using content and links, In: The 22nd International Conference on World Wide Web, pp. 1089\u20131098.","DOI":"10.1145\/2488388.2488483"},{"issue":"8","key":"8067_CR22","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","volume":"388","author":"H Shen","year":"2009","unstructured":"Shen H, Cheng X, Cai K et al (2009) Detect overlapping and hierarchical community structure in networks. Physica A 388(8):1706\u20131712","journal-title":"Physica A"},{"key":"8067_CR23","doi-asserted-by":"publisher","first-page":"41830","DOI":"10.1038\/srep41830","volume":"7","author":"Y Su","year":"2017","unstructured":"Su Y, Wang B, Zhang X (2017) A seed-expanding method based on random walks for community detection in networks with ambiguous community structures. Sci Rep 7:41830","journal-title":"Sci Rep"},{"issue":"6","key":"8067_CR24","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1049\/cje.2017.09.012","volume":"27","author":"L Sun","year":"2018","unstructured":"Sun L, Liu J, Zheng X et al (2018) An efficient and adaptive method for overlapping community detection in real-world networks. Chin J Electron 27(6):1126\u20131132","journal-title":"Chin J Electron"},{"key":"8067_CR25","doi-asserted-by":"publisher","first-page":"25258","DOI":"10.1109\/ACCESS.2017.2769484","volume":"5","author":"X Wang","year":"2017","unstructured":"Wang X, Liu G, Li J (2017) Overlapping community detection based on structural centrality in complex networks. IEEE Access 5:25258\u201325269","journal-title":"IEEE Access"},{"key":"8067_CR26","unstructured":"Wang Qing, GU Chun-mei, ZHAO Jian-jun, CUI Xin, HONG Wen-xing, XU Wen-jing. (2019) Hybrid Parameter Adaptive Overlapping Community Discovery Algorithm based on Edge Trust. J Tianjin Univ (Nat Sci Eng Technol Edition), 52(06):618-624"},{"issue":"6684","key":"8067_CR27","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019networks. Nature 393(6684):440\u2013442","journal-title":"Nature"},{"key":"8067_CR28","doi-asserted-by":"crossref","unstructured":"Xie J, Szymanski B K, Liu X (2011) Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 ieee 11th international conference on data mining workshops. IEEE: 344\u2013349","DOI":"10.1109\/ICDMW.2011.154"},{"key":"8067_CR29","doi-asserted-by":"crossref","unstructured":"Xu Z, Ke Y, Wang Y, Cheng H, Cheng J, (2012) A model-based approach to attributed graph clustering, In: The 2012 ACM SIGMOD International Conference on Management of Data, pp. 505\u2013516.","DOI":"10.1145\/2213836.2213894"},{"key":"8067_CR30","doi-asserted-by":"crossref","unstructured":"Yang J, McAuley J, Leskovec, J (2013) Community detection in networks with node attributes. In: 2013 IEEE 13th international conference on data mining, 1151\u20131156.","DOI":"10.1109\/ICDM.2013.167"},{"key":"8067_CR31","unstructured":"Yan Li, Jing He, Youxi Wu (2019) Discovery method of seed node greedy Expansion in overlapping communities. Minicomputer system (5): 39."},{"key":"8067_CR32","volume-title":"Networks: an introduction by MEJ Newman: Oxford, UK: Oxford University Press. 720 pp, $85.00","author":"S Yang","year":"2013","unstructured":"Yang S (2013) Networks: an introduction by MEJ Newman: Oxford, UK: Oxford University Press. 720 pp, $85.00. Taylor & Francis, Abingdon"},{"key":"8067_CR33","doi-asserted-by":"crossref","unstructured":"Yang J, McAuley J, Leskovec J, (2013) Community detection in networks with node attributes, In: The 13th IEEE International Conference on Data Mining, pp. 1151\u20131156.","DOI":"10.1109\/ICDM.2013.167"},{"issue":"4","key":"8067_CR34","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"key":"8067_CR35","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.physa.2014.11.023","volume":"421","author":"Z Zhang","year":"2015","unstructured":"Zhang Z, Wang Z (2015) Mining overlapping and hierarchical communities in complex networks. Physica A 421:25\u201333","journal-title":"Physica A"},{"key":"8067_CR14","unstructured":"Zhigang Lu, Wu Lu. (2019) Discovery of overlapping communities based on greedy Faction Expansion in ESN [J]. Computer engineering (7): 6"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08067-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08067-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08067-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T13:11:55Z","timestamp":1692882715000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08067-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,6]]},"references-count":35,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["8067"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08067-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-486226\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,6]]},"assertion":[{"value":"23 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Follow the algorithm to complete the code.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}