{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T10:58:24Z","timestamp":1778410704542,"version":"3.51.4"},"reference-count":54,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,12,24]],"date-time":"2020-12-24T00:00:00Z","timestamp":1608768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The real world can be characterized as a complex network sto in symmetric matrix. Community discovery (or community detection) can effectively reveal the common features of network groups. The communities are overlapping since, in fact, one thing often belongs to multiple categories. Hence, overlapping community discovery has become a new research hotspot. Since the results of the existing community discovery algorithms are not robust enough, this paper proposes an effective algorithm, named Two Expansions of Seeds (TES). TES adopts the topological feature of network nodes to find the local maximum nodes as the seeds which are based on the gravitational degree, which makes the community discovery robust. Then, the seeds are expanded by the greedy strategy based on the fitness function, and the community cleaning strategy is employed to avoid the nodes with negative fitness so as to improve the accuracy of community discovery. After that, the gravitational degree is used to expand the communities for the second time. Thus, all nodes in the network belong to at least one community. Finally, we calculate the distance between the communities and merge similar communities to obtain a less- undant community structure. Experimental results demonstrate that our algorithm outperforms other state-of-the-art algorithms.<\/jats:p>","DOI":"10.3390\/sym13010018","type":"journal-article","created":{"date-parts":[[2020,12,24]],"date-time":"2020-12-24T22:56:45Z","timestamp":1608850605000},"page":"18","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Overlapping Community Discovery Method Based on Two Expansions of Seeds"],"prefix":"10.3390","volume":"13","author":[{"given":"Yan","family":"Li","sequence":"first","affiliation":[{"name":"School of Economics and Management, Hebei University of Technology, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"He","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Hebei University of Technology, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5314-3468","authenticated-orcid":false,"given":"Youxi","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Hebei University of Technology, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rongjie","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Hebei University of Technology, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,12,24]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"6267","DOI":"10.1007\/s00500-018-3283-x","article-title":"Social community detection and message propagation scheme based on personal willingness in social network","volume":"23","author":"Gu","year":"2019","journal-title":"Soft Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s41019-019-00113-0","article-title":"Bi-labeled LDA: Inferring interest tags for non-famous users in social network","volume":"5","author":"He","year":"2020","journal-title":"Data Sci. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"11707","DOI":"10.1109\/ACCESS.2018.2808407","article-title":"IBAS: Index based A-star","volume":"6","author":"Li","year":"2018","journal-title":"IEEE Access"},{"key":"ref_4","unstructured":"Dolgorsuren, B., Xu, W., Khan, K.U., Jeong, B.S., and Lee, Y.K. (2016, January 17\u201319). SP2: Spanner construction for shortest path computation on streaming graph. Proceedings of the Sixth International Conference on Emerging Databases: Technologies, Applications, and Theory, Jeju Island, Korea."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3731","DOI":"10.1007\/s10489-019-01479-4","article-title":"EM-FGS: Graph sparsification via faster semi-metric edges pruning","volume":"49","author":"Batjargal","year":"2019","journal-title":"Appl. Intell."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TCYB.2017.2750691","article-title":"NOSEP: Nonoverlapping sequence pattern mining with gap constraints","volume":"48","author":"Wu","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Hai, M., Li, H., Ma, Z., and Gao, X. (2019). Algorithm for detecting communities in complex networks based on Hadoop. Symmetry, 11.","DOI":"10.3390\/sym11111382"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1007\/s10489-019-01616-z","article-title":"NetNPG: Nonoverlapping pattern matching with general gap constraints","volume":"50","author":"Shi","year":"2020","journal-title":"Appl. Intell."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"012101","DOI":"10.1007\/s11432-015-0935-3","article-title":"Strict pattern matching under non-overlapping condition","volume":"60","author":"Wu","year":"2017","journal-title":"Sci. China Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Bu, Z., Li, H.J., Zhang, C., Cao, J., Li, A., and Shi, Y. (2019). Graph k-means based on leader identification, dynamic game and opinion dynamics. IEEE Trans. Knowl. Data Eng.","DOI":"10.1109\/TKDE.2019.2903712"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/TETCI.2018.2829906","article-title":"Enhance the performance of network computation by a tunable weighting strategy","volume":"2","author":"Li","year":"2018","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Chen, D., Fu, Y., and Shang, M. (2009, January 19\u201321). An efficient algorithm for overlapping community detection in complex networks. Proceedings of the WRI Global Congress on Intelligent Systems, Xiamen, China.","DOI":"10.1109\/GCIS.2009.68"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1016\/j.ins.2015.05.008","article-title":"Description-oriented community detection using exhaustive subgroup discovery","volume":"329","author":"Atzmueller","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Geng, X., Lu, H., and Sun, J. (2020). Network structural transformation-based community detection with autoencoder. Symmetry, 12.","DOI":"10.3390\/sym12060944"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"6669","DOI":"10.1007\/s10586-018-2402-x","article-title":"Research on of overlapping community detection algorithm based on tag influence","volume":"22","author":"Chen","year":"2019","journal-title":"Clust. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: A user guide","volume":"659","author":"Fortunato","year":"2016","journal-title":"Phys. Rep."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.jnca.2018.02.011","article-title":"Community detection in networks: A multidisciplinary review","volume":"108","author":"Javed","year":"2018","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_18","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_19","doi-asserted-by":"crossref","unstructured":"Guerrero, M., Gil, C., Montoya, F.G., Alcayde, A., and Ba\u00f1os, R. (2020). Multi-objective evolutionary algorithms to find community structures in large networks. Mathematics, 8.","DOI":"10.3390\/math8112048"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/3106370","article-title":"Local spectral clustering for overlapping community detection","volume":"12","author":"Li","year":"2018","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_21","first-page":"289","article-title":"Overlapping community discovery based on node hierarchy and label propagation gain","volume":"28","author":"Chen","year":"2015","journal-title":"Pattern Recognit. Artif. Intell."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1850008","DOI":"10.1142\/S0218001418500088","article-title":"Overlapping community discovery algorithm based on hierarchical agglomerative clustering","volume":"32","author":"Liu","year":"2015","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.neucom.2019.01.074","article-title":"EADP: An extended adaptive density peaks clustering for overlapping community detection in social networks","volume":"337","author":"Xu","year":"2019","journal-title":"Neurocomputing"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Guerrero, M., Ba\u00f1os, R., Gil, C., Montoya, F.G., and Alcayde, A. (2019). Evolutionary algorithms for community detection in continental-scale high-voltage transmission grids. Symmetry, 11.","DOI":"10.3390\/sym11121472"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Li, Y., Wang, J., Wang, X., Zhao, Y., Lu, X., and Liu, D. (2017). Community detection based on differential evolution using social spider optimization. Symmetry, 9.","DOI":"10.3390\/sym9090183"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1111\/coin.12087","article-title":"LinkLPA: A link-based label propagation algorithm for overlapping community detection in networks","volume":"33","author":"Sun","year":"2017","journal-title":"Comput. Intell."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","article-title":"Link communities reveal multiscale complexity in networks","volume":"466","author":"Ahn","year":"2010","journal-title":"Nature"},{"key":"ref_28","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_29","doi-asserted-by":"crossref","first-page":"2011","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."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1177\/0165551515592599","article-title":"Semantic community detection using label propagation algorithm","volume":"42","author":"Kianian","year":"2015","journal-title":"J. Inf. Sci."},{"key":"ref_31","first-page":"19","article-title":"Detecting the overlapping and hierarchical community structure of complex networks","volume":"11","author":"Lancichinetti","year":"2008","journal-title":"New J. Phys."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Coscia, M., Rossetti, G., Giannotti, F., and Pedreschi, D. (2012, January 12\u201316). DEMON: A local-first discovery method for overlapping communities. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China.","DOI":"10.1145\/2339530.2339630"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10489-016-0838-3","article-title":"Toward a novel art inspi incremental community mining algorithm in dynamic social network","volume":"46","author":"Cheraghchi","year":"2017","journal-title":"Appl. Intell."},{"key":"ref_34","unstructured":"Yang, L., Cao, X., He, D., Wang, C., Wang, X., and Zhang, W. (2016, January 9\u201315). Modularity based community detection with deep learning. Proceedings of the International Joint Conference on Artificial Intelligence, New York, NY, USA."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"2585","DOI":"10.1109\/TCYB.2014.2377154","article-title":"A unified semi-supervised community detection framework using latent space graph regularization","volume":"45","author":"Yang","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"ref_36","unstructured":"Gregory, S. (2007, January 17\u201321). An algorithm to find overlapping community structure in networks. In Proceedings of the European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1177\/0165551515621005","article-title":"A community-based approach to identify the most influential nodes in social networks","volume":"43","author":"Maryam","year":"2017","journal-title":"J. Inf. Sci."},{"key":"ref_38","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_39","doi-asserted-by":"crossref","unstructured":"Gleich, D., and Seshadhri, C. (2012, January 12\u201316). Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China.","DOI":"10.1145\/2339530.2339628"},{"key":"ref_40","unstructured":"Whang, J., Gleich, D., and Dhillon, I. (November, January 27). Overlapping community detection using seed set expansion. Proceedings of the 22nd ACM International Conference on Information Knowledge Management, San Francisco, CA, USA."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1177\/0165551517698305","article-title":"A fast multi-level algorithm for community detection in directed online social networks","volume":"44","author":"Su","year":"2018","journal-title":"J. Inf. Sci."},{"key":"ref_42","unstructured":"Lee, C., Reid, F., Mcdaid, A., and Hurley, N. (2010, January 25). Detecting highly overlapping community structure by greedy clique expansion. Proceedings of the fourth SNA-KDD Workshop on Social Network Mining and Analysis, Washington, DC, USA."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Cai, G., Wang, R., and Liu, G. (2012, January 14\u201315). Hierarchical overlapping community discovery algorithm based on node purity. Proceedings of the International Conference on Intelligent Information Processing, Haikou, Hainan, China.","DOI":"10.1007\/978-3-642-32891-6_32"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.3233\/IDA-173561","article-title":"Social community evolution by combining gravitational relationship with community structure","volume":"22","author":"Liu","year":"2018","journal-title":"Intell. Data Anal."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Li, Y. (2011). A new vertex similarity metric for community discovery: A distance neighbor model. Asian Conference on Intelligent Information and Database Systems, Springer.","DOI":"10.1007\/978-3-642-20039-7_23"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"105812","DOI":"10.1016\/j.knosys.2020.105812","article-title":"NetNCSP: Nonoverlapping closed sequential pattern mining","volume":"196","author":"Wu","year":"2020","journal-title":"Knowl. Based Syst."},{"key":"ref_47","first-page":"1376","article-title":"Semi-supervised local expansion method for overlapping community detection","volume":"53","author":"Chen","year":"2016","journal-title":"Comput. Res. Dev."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1997","journal-title":"J. Anthropol. Res."},{"key":"ref_49","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_50","unstructured":"Knuth, D.E. (1993). The Stanford GraphBase: A Platform for Combinatorial Computing, ACM Press."},{"key":"ref_51","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_52","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of small-world networks","volume":"93","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_53","first-page":"3166","article-title":"Extending the definition of modularity to directed graphs with overlapping communities","volume":"3","author":"Nicosia","year":"2009","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/1\/18\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:45:27Z","timestamp":1760179527000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/1\/18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,24]]},"references-count":54,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,1]]}},"alternative-id":["sym13010018"],"URL":"https:\/\/doi.org\/10.3390\/sym13010018","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,24]]}}}