{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:14:08Z","timestamp":1760235248080,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100009625","name":"Beijing Social Science Fund","doi-asserted-by":"publisher","award":["No. 11JGB063"],"award-info":[{"award-number":["No. 11JGB063"]}],"id":[{"id":"10.13039\/501100009625","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Social Science Research Project of Ministry of Education","award":["No.11YJA630109"],"award-info":[{"award-number":["No.11YJA630109"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>It is a common phenomenon in real life that individuals have diverse member relationships in different social clusters, which is called overlap in the science of network. Detecting overlapping components of the community structure in a network has extensive value in real-life applications. The mainstream algorithms for community detection generally focus on optimization of a global or local static metric. These algorithms are often not good when the community characteristics are diverse. In addition, there is a lot of randomness in the process of the algorithm. We proposed a algorithm combining local expansion and label propagation. In the stage of local expansion, the seed is determined by the node pair with the largest closeness, and the rule of expansion also depends on closeness. Local expansion is just to obtain the center of expected communities instead of final communities, and these immature communities leave only dense regions after pruning according to certain rules. Taking the dense regions as the source makes the label propagation reach stability rapidly in the early propagation so that the final communities are detected more accurately. The experiments in synthetic and real-world networks proved that our algorithm is more effective not only on the whole, but also at the level of the node. In addition, it is stable in the face of different network structures and can maintain high accuracy.<\/jats:p>","DOI":"10.3390\/a14080237","type":"journal-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T08:35:52Z","timestamp":1628670952000},"page":"237","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Detect Overlapping Community Based on the Combination of Local Expansion and Label Propagation"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1693-0857","authenticated-orcid":false,"given":"Xu","family":"Li","sequence":"first","affiliation":[{"name":"Applied Economics, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiming","family":"Sun","sequence":"additional","affiliation":[{"name":"Management Science and Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"ref_1","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":"ref_2","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"Newman","year":"2006","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Alzahrani, T., Horadam, K.J., and Boztas, S. (2014). Community Detection in Bipartite Networks Using Random Walks, Springer.","DOI":"10.1007\/978-3-319-05401-8_15"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.neunet.2014.04.006","article-title":"Discrete particle swarm optimization for identifying community structures in signed social networks","volume":"58","author":"Cai","year":"2014","journal-title":"Neural Netw."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"White, S., and Smyth, P. (2005, January 21\u201323). A Spectral Clustering Approach To Finding Communities in Graph. Proceedings of the 2005 SIAM International Conference on Data Mining, Newport Beach, CA, USA.","DOI":"10.1137\/1.9781611972757.25"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","article-title":"Community detection algorithms: A comparative analysis","volume":"80","author":"Lancichinetti","year":"2009","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_7","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."},{"key":"ref_8","unstructured":"Baumes, J., Goldberg, M., and Krishnamoorthy, M. (2005, January 22\u201325). Finding communities by clustering a graph into overlapping subgraphs. Proceedings of the AC 2005 IADIS International Conference on Applied Computing, Algarve, Portugal."},{"key":"ref_9","first-page":"012811-1","article-title":"A General Optimization Technique for High Quality Community Detection in Complex Networks","volume":"90","author":"Sobolevsky","year":"2013","journal-title":"Phys. Rev. E"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s13278-015-0299-4","article-title":"Community detection based on strong Nash stable graph partition","volume":"5","author":"Basu","year":"2015","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_11","first-page":"161","article-title":"Using of Jaccard Coefficient for Keywords Similarity","volume":"26","author":"Niwattanakul","year":"2013","journal-title":"Ai Commun."},{"key":"ref_12","first-page":"68","article-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","volume":"30","author":"Langville","year":"2011","journal-title":"Math. Intell."},{"key":"ref_13","unstructured":"Kelley, S. (2009). The Existence and Discovery of Overlapping Communities in Large-Scale Networks, Rensselaer Polytechnic Institute."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","article-title":"Detecting the overlapping and hierarchical community structure of complex networks","volume":"11","author":"Lancichinetti","year":"2009","journal-title":"New J. Phys."},{"key":"ref_15","first-page":"01023","article-title":"Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels","volume":"2011","author":"Havemann","year":"2011","journal-title":"Comput. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1109\/TKDE.2016.2518687","article-title":"Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion","volume":"28","author":"Whang","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"026129","DOI":"10.1103\/PhysRevE.80.026129","article-title":"Detecting network communities by propagating labels under constraints","volume":"80","author":"Barber","year":"2009","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_18","first-page":"2011","article-title":"Finding overlapping communities in networks by label propagation","volume":"12","author":"Gregory","year":"2009","journal-title":"New J. Phys."},{"key":"ref_19","unstructured":"Xie, J., and Szymanski, B.K. (2016, January 19\u201322). Towards Linear Time Overlapping Community Detection in Social Networks. Proceedings of the The 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining, Auckland, New Zealand."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1002\/rsa.20270","article-title":"Clique percolation","volume":"35","author":"Riordan","year":"2009","journal-title":"Random Struct. Algorithms"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","article-title":"Detect overlapping and hierarchical community structure in networks","volume":"388","author":"Shen","year":"2009","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s10618-010-0186-6","article-title":"A game-theoretic framework to identify overlapping communities in social networks","volume":"21","author":"Chen","year":"2010","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1016\/j.physleta.2018.01.036","article-title":"A game theoretic algorithm to detect overlapping community structure in networks","volume":"382","author":"Zhou","year":"2018","journal-title":"Phys. Lett. A"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.knosys.2017.02.018","article-title":"IEDC: An Integrated Approach for Overlapping and Non-overlapping Community Detection","volume":"123","author":"Hajiabadi","year":"2017","journal-title":"Knowl. Based Syst."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"036103","DOI":"10.1103\/PhysRevE.84.036103","article-title":"An efficient and principled method for detecting communities in networks","volume":"84","author":"Ball","year":"2011","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/TNN.2008.2005601","article-title":"Normalized Mutual Information Feature Selection","volume":"20","author":"Tesmer","year":"2009","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Goutte, C., and Gaussier, E. (2005). A Probabilistic Interpretation of Precision, Recall and F-Score, with Implication for Evaluation. The 2005 European Conference on Information Retrieval, Springer.","DOI":"10.1007\/978-3-540-31865-1_25"},{"key":"ref_28","first-page":"02017","article-title":"Fuzzy overlapping communities in networks","volume":"2","author":"Gregory","year":"2010","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"016107","DOI":"10.1103\/PhysRevE.77.016107","article-title":"Fuzzy communities and the concept of bridgeness in complex networks","volume":"77","author":"Nepusz","year":"2008","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phys. Rev. E"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"016107","DOI":"10.1103\/PhysRevE.74.016107","article-title":"Clustering algorithm for determining community structure in large networks","volume":"74","author":"Pujol","year":"2006","journal-title":"Phys. Rev. E Stat. Nonlinear Soft Matter Phys."},{"key":"ref_32","first-page":"72","article-title":"Mixing local and global information for community detection in large networks","volume":"80","author":"De","year":"2013","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","article-title":"The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations","volume":"54","author":"Lusseau","year":"2003","journal-title":"Behav. Ecol. Sociobiol."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., and Leskovec, J. (2017, January 13\u201317). Local Higher-Order Graph Clustering. Proceedings of the 23rd ACM SIGKDD International Conference, Halifax, NS, Canada.","DOI":"10.1145\/3097983.3098069"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1132952.1132954","article-title":"Graph Evolution: Densification and Shrinking Diameters","volume":"38","author":"Chakrabarti","year":"2006","journal-title":"ACM Comput. Surv."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.M., and Faloutsos, C. (2005, January 21\u201324). Graphs over time: Densification laws, shrinking diameters and possible explanations. Proceedings of the The Eleventh ACM SIGKDD International Conference, Chicago, IL, USA.","DOI":"10.1145\/1081870.1081893"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/8\/237\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:44:08Z","timestamp":1760165048000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/8\/237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,11]]},"references-count":37,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2021,8]]}},"alternative-id":["a14080237"],"URL":"https:\/\/doi.org\/10.3390\/a14080237","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2021,8,11]]}}}