{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T11:14:01Z","timestamp":1760181241503,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T00:00:00Z","timestamp":1607299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.2018YFB1003602"],"award-info":[{"award-number":["No.2018YFB1003602"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>With the rapid development of computer technology, the research on complex networks has attracted more and more attention. At present, the research directions of cloud computing, big data, internet of vehicles, and distributed systems with very high attention are all based on complex networks. Community structure detection is a very important and meaningful research hotspot in complex networks. It is a difficult task to quickly and accurately divide the community structure and run it on large-scale networks. In this paper, we put forward a new community detection approach based on internode attraction, named IACD. This algorithm starts from the perspective of the important nodes of the complex network and refers to the gravitational relationship between two objects in physics to represent the forces between nodes in the network dataset, and then perform community detection. Through experiments on a large number of real-world datasets and synthetic networks, it is shown that the IACD algorithm can quickly and accurately divide the community structure, and it is superior to some classic algorithms and recently proposed algorithms.<\/jats:p>","DOI":"10.3390\/e22121383","type":"journal-article","created":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T12:24:39Z","timestamp":1607343879000},"page":"1383","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Research on Community Detection in Complex Networks Based on Internode Attraction"],"prefix":"10.3390","volume":"22","author":[{"given":"Jinfang","family":"Sheng","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]},{"given":"Cheng","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]},{"given":"Long","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8815-7533","authenticated-orcid":false,"given":"Bin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]},{"given":"Junkai","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}]}],"member":"1968","published-online":{"date-parts":[[2020,12,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Shao, J., B\u00f6hm, C., Yang, Q., and Plant, C. (2010). Synchronization Based Outlier Detection. Machine Learning and Knowledge Discovery in Databases, Proceedings of the Joint European Conference on Machine Learning & Knowledge Discovery in Databases, Skopje, Macedonia, 18\u201322 September 2017, Springer.","DOI":"10.1007\/978-3-642-15939-8_16"},{"key":"ref_2","first-page":"93","article-title":"Synchronization-Inspired Partitioning and Hierarchical Clustering","volume":"25","author":"Shao","year":"2013","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-018-1209-7","article-title":"Fast detection of community structures using graph traversal in social networks","volume":"59","author":"Basuchowdhuri","year":"2019","journal-title":"Knowl. Inf. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Jiang, F., and Xu, J. (November, January 29). Dynamic community detection based on game theory in social networks. Proceedings of the 2015 IEEE International Conference on Big Data (Big Data), Santa Clara, CA, USA.","DOI":"10.1109\/BigData.2015.7364029"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1504\/IJES.2019.098295","article-title":"Sign prediction and community detection in directed signed networks based on random walk theory","volume":"11","author":"Hu","year":"2019","journal-title":"Int. J. Embed. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Wang, W., and Street, W.N. (2015, January 14\u201317). Finding hierarchical communities in complex networks using influence-guided label propagation. Proceedings of the 2015 IEEE International Conference on Data Mining Workshop (ICDMW), Atlantic City, NJ, USA.","DOI":"10.1109\/ICDMW.2015.58"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Xie, J., and Szymanski, B.K. (2011, January 22\u201324). Community detection using a neighborhood strength driven label propagation algorithm. Proceedings of the 2011 IEEE Network Science Workshop, West Point, NY, USA.","DOI":"10.1109\/NSW.2011.6004645"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Huberman, B.A., Romero, D.M., and Wu, F. (2008). Social networks that matter: Twitter under the microscope. arXiv.","DOI":"10.5210\/fm.v14i1.2317"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.07.002","article-title":"Dynamics of information diffusion and its applications on complex networks","volume":"651","author":"Zhang","year":"2016","journal-title":"Phys. Rep."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"012001","DOI":"10.1088\/1742-6596\/835\/1\/012001","article-title":"Detection of protein complex from protein-protein interaction network using Markov clustering","volume":"835","author":"Ochieng","year":"2017","journal-title":"J. Phys. Conf. Ser."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"036106","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"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Par\u00e9s, F., Gasulla, D.G., Vilalta, A., Moreno, J., Ayguad\u00e9, E., Labarta, J., Cort\u00e9s, U., and Suzumura, T. (2017). Fluid communities: A competitive, scalable and diverse community detection algorithm. Complex Networks & Their Applications VI, Proceedings of the International Conference on Complex Networks and their Applications, Lyon, France, 29 November \u20131 December 2017, Springer.","DOI":"10.1007\/978-3-319-72150-7_19"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"28003","DOI":"10.1209\/0295-5075\/103\/28003","article-title":"Community detection and graph partitioning","volume":"103","author":"Newman","year":"2013","journal-title":"EPL Europhys. Lett."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat. Phys."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_17","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":"ref_18","doi-asserted-by":"crossref","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., and Mattheyses, R.M. (1982, January 14\u201316). A linear-time heuristic for improving network partitions. Proceedings of the 19th Design Automation Conference, Las Vegas, NV, USA.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"ref_20","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."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection","volume":"104","author":"Fortunato","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality index of a graph","volume":"31","author":"Sabidussi","year":"1966","journal-title":"Psychometrika"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"056103","DOI":"10.1103\/PhysRevE.71.056103","article-title":"Subgraph centrality in complex networks","volume":"71","author":"Estrada","year":"2005","journal-title":"Phys. Rev. E"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"L\u00fc, L., Zhang, Y.C., Yeung, C.H., and Zhou, T. (2011). Leaders in social networks, the delicious case. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0021202"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","article-title":"Authoritative sources in a hyperlinked environment","volume":"46","author":"Kleinberg","year":"1999","journal-title":"J. ACM"},{"key":"ref_29","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_30","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":"1977","journal-title":"J. Anthropol. Res."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","article-title":"Defining and evaluating network communities based on ground-truth","volume":"42","author":"Yang","year":"2015","journal-title":"Knowl. Inf. Syst."},{"key":"ref_32","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_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","unstructured":"Cai, D., Shao, Z., He, X., Yan, X., and Han, J. (2005). Mining hidden community in heterogeneous social networks. LinkKDD \u201905, Proceedings of the 3rd International Workshop on Link Discovery, Illinois, IL, USA, 21 August 2005, ACM.","DOI":"10.1145\/1134271.1134280"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"121765","DOI":"10.1016\/j.physa.2019.121765","article-title":"Community detection based on human social behavior","volume":"531","author":"Sheng","year":"2019","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_36","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_37","unstructured":"Baron, J. (2020, December 02). Community Structure Detecting Based on the Leading Eigenvector of the Community Matrix. Available online: http:\/\/finzi.psych.upenn.edu\/library\/igraph\/html\/cluster_leading_eigen.html."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.neucom.2019.06.020","article-title":"Community Detection based on Information Dynamics","volume":"359","author":"Sun","year":"2019","journal-title":"Neurocomputing"},{"key":"ref_39","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"},{"key":"ref_40","first-page":"583","article-title":"Cluster ensembles\u2014A knowledge reuse framework for combining multiple partitions","volume":"3","author":"Strehl","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","article-title":"Objective criteria for the evaluation of clustering methods","volume":"66","author":"Rand","year":"1971","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_42","unstructured":"Zhao, Y., and Karypis, G. (2020, December 02). Criterion Functions for Document Clustering: Experiments and Analysis. Available online: http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.402.4633&rep=rep1&type=pdf."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/12\/1383\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:41:52Z","timestamp":1760179312000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/12\/1383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,7]]},"references-count":42,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2020,12]]}},"alternative-id":["e22121383"],"URL":"https:\/\/doi.org\/10.3390\/e22121383","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2020,12,7]]}}}