{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T12:56:55Z","timestamp":1781269015725,"version":"3.54.1"},"reference-count":55,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2019,11,23]],"date-time":"2019-11-23T00:00:00Z","timestamp":1574467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802034"],"award-info":[{"award-number":["61802034"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Soft science fund of Sichuan Province","award":["2019JDR0117"],"award-info":[{"award-number":["2019JDR0117"]}]},{"name":"the Open Fund of Key Laboratory of the Ministry of Education of China","award":["13zxzk01"],"award-info":[{"award-number":["13zxzk01"]}]},{"name":"the Digital Media Science Innovation Team of CDUT","award":["10912-kytd201510"],"award-info":[{"award-number":["10912-kytd201510"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Community detection in networks plays a key role in understanding their structures, and the application of clustering algorithms in community detection tasks in complex networks has attracted intensive attention in recent years. In this paper, based on the definition of uncertainty of node community belongings, the node density is proposed first. After that, the DD (the combination of node density and node degree centrality) is proposed for initial node selection in community detection. Finally, based on the DD and k-means clustering algorithm, we proposed a community detection approach, the density-degree centrality-jaccard-k-means method (DDJKM). The DDJKM algorithm can avoid the problem of random selection of initial cluster centers in conventional k-means clustering algorithms, so that isolated nodes will not be selected as initial cluster centers. Additionally, DDJKM can reduce the iteration times in the clustering process and the over-short distances between the initial cluster centers can be avoided by calculating the node similarity. The proposed method is compared with state-of-the-art algorithms on synthetic networks and real-world networks. The experimental results show the effectiveness of the proposed method in accurately describing the community. The results also show that the DDJKM is practical a approach for the detection of communities with large network datasets.<\/jats:p>","DOI":"10.3390\/e21121145","type":"journal-article","created":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T03:10:00Z","timestamp":1574651400000},"page":"1145","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Community Detection Method Based on Node Density, Degree Centrality, and K-Means Clustering in Complex Network"],"prefix":"10.3390","volume":"21","author":[{"given":"Biao","family":"Cai","sequence":"first","affiliation":[{"name":"College of Information Science &Technology, Chengdu University of Technology, Chengdu 610059, China"},{"name":"Key Laboratory of Manufacturing Process Testing Technology of Ministry of Education of China, Southwest of University of Science and Technology, Mianyang 621010, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lina","family":"Zeng","sequence":"additional","affiliation":[{"name":"College of Information Science &Technology, Chengdu University of Technology, Chengdu 610059, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanpeng","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Information Science &Technology, Chengdu University of Technology, Chengdu 610059, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongjun","family":"Li","sequence":"additional","affiliation":[{"name":"College of Information Science &Technology, Chengdu University of Technology, Chengdu 610059, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanmei","family":"Hu","sequence":"additional","affiliation":[{"name":"College of Information Science &Technology, Chengdu University of Technology, Chengdu 610059, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1038\/445489a","article-title":"A twenty-first century science","volume":"445","author":"Watts","year":"2007","journal-title":"Nature"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1109\/MIS.2007.41","article-title":"Social computing: From social informatics to social intelligence","volume":"22","author":"Wang","year":"2007","journal-title":"IEEE Intell. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.automatica.2009.10.024","article-title":"Synchronization of complex dynamical networks under recoverable attacks","volume":"46","author":"Wang","year":"2010","journal-title":"Automatica"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","article-title":"Community detection in social media performance and application considerations","volume":"24","author":"Papadopoulos","year":"2012","journal-title":"Data Min. Knowl. Disc."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1109\/TNN.2011.2146274","article-title":"Adaptive neural network decentralized backstepping output-feedback control for nonlinear large-scale systems with time delays","volume":"22","author":"Tong","year":"2011","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1919","DOI":"10.1109\/TBME.2013.2296778","article-title":"Network community structure detection for directional neural networks inferred from multichannel multisubject EEG data","volume":"61","author":"Liu","year":"2014","journal-title":"IEEE Trans. Biomed. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s11192-009-0040-z","article-title":"Detecting, identifying and visualizing research groups in co-authorship networks","volume":"82","year":"2010","journal-title":"Scientometrics"},{"key":"ref_8","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_9","doi-asserted-by":"crossref","unstructured":"Liu, C., Du, Y., and Lei, J. (2019). A SOM-Based Membrane Optimization Algorithm for Community Detection. Entropy, 21.","DOI":"10.3390\/e21050533"},{"key":"ref_10","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."},{"key":"ref_11","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"},{"key":"ref_12","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_13","first-page":"1","article-title":"Ubiquitousness of link-density and link-pattern communities in real-world networks","volume":"85","author":"Bajec","year":"2012","journal-title":"Eur. Phys. J. B"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"4606","DOI":"10.1016\/j.physa.2013.05.039","article-title":"Community detection in complex networks by density-based clustering","volume":"392","author":"Jin","year":"2013","journal-title":"Phys. A"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.physa.2014.01.043","article-title":"Novel heuristic density-based method for community detection in networks","volume":"403","author":"Gong","year":"2014","journal-title":"Phys. A"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"061901","DOI":"10.1103\/PhysRevE.67.061901","article-title":"Distance, dissimilarity index, and network community structure","volume":"67","author":"Zhou","year":"2003","journal-title":"Phys. Rev. E"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","author":"Rosvall","year":"2008","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_18","first-page":"281","article-title":"Some Methods for Classification and Analysis of Multivariate Observations","volume":"Volume 1","author":"Neyman","year":"1967","journal-title":"Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, USA, 21\u201327 July 1965, 27 December\u20137 January 1965"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2182","DOI":"10.1016\/j.physa.2012.12.013","article-title":"An efficient community detection method based on rank centrality","volume":"392","author":"Jiang","year":"2013","journal-title":"Phys. A"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.physa.2015.06.043","article-title":"A parameter-free community detection method based on centrality and dispersion of nodes in complex networks","volume":"438","author":"Li","year":"2015","journal-title":"Phys. A"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.physa.2015.05.101","article-title":"A novel cosine distance for detecting communities in complex networks","volume":"437","author":"Wang","year":"2015","journal-title":"Phys. A"},{"key":"ref_22","first-page":"805","article-title":"Review and comparative study of clustering techniques","volume":"5","author":"Popat","year":"2014","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","article-title":"A comparative study of efficient initialization methods for the k-means clustering al-gorithm","volume":"40","author":"Celebi","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_24","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_25","doi-asserted-by":"crossref","first-page":"1958","DOI":"10.1016\/j.physa.2017.11.110","article-title":"Node similarity and modularity for finding communities in networks","volume":"492","author":"Bilal","year":"2018","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: A survey","volume":"390","author":"Zhou","year":"2011","journal-title":"Phys. A"},{"key":"ref_27","unstructured":"Salton, G., and Mcgill, M.J. (1983). Introduction to Modern Information Retrieval, McGraw\u2013Hill."},{"key":"ref_28","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des alpes et des jura","volume":"37","author":"Jaccard","year":"1901","journal-title":"Bulletin De La Societe Vaudoise des Science Naturelles"},{"key":"ref_29","first-page":"1","article-title":"A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on danish commons","volume":"5","author":"Srensen","year":"1948","journal-title":"Videnski Selsk Biol. Skr."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1126\/science.1073374","article-title":"Hierarchical organization of modularity in metabolic networks","volume":"297","author":"Ravasz","year":"2002","journal-title":"Science"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barabasi","year":"1999","journal-title":"Science"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","author":"Adamic","year":"2003","journal-title":"Soc. Netw."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting missing links via local information","volume":"71","author":"Zhou","year":"2009","journal-title":"Eur. Phys. J. B."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"191","DOI":"10.7155\/jgaa.00124","article-title":"Computing Communities in Large Networks Using Random Walks","volume":"10","author":"Pons","year":"2006","journal-title":"J. Graph Algorithms Appl."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jcss.2013.03.012","article-title":"Mixing local and global information for community detection in large networks","volume":"80","author":"Ferrara","year":"2014","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Okuda, M., Satoh, S., Iwasawa, S., Yoshida, S., Kidawara, Y., and Sato, Y. (2017). Community detection using random-walk similarity and application to image clustering. ICIP, 1292\u20131296.","DOI":"10.1109\/ICIP.2017.8296490"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.physa.2016.10.086","article-title":"Identification of influential nodes in complex networks: Method from spreading probability viewpoint","volume":"468","author":"Bao","year":"2017","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1350096","DOI":"10.1142\/S0129183113500964","article-title":"Community centrality for node\u2019s influential ranking in complex network","volume":"25","author":"Cai","year":"2014","journal-title":"Int. J. Mod. Phys. C"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Newman, M.E., and Reinert, G. (2016). Estimating the Number of Communities in a Network. Phys. Rev.Lett., 117.","DOI":"10.1103\/PhysRevLett.117.078301"},{"key":"ref_40","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_41","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_42","doi-asserted-by":"crossref","unstructured":"Newman, M. (2019, August 25). Mark Newman\u2019s Network Data Collection. Available online: http:\/\/www-personal.umich.edu\/~mejn\/netdata.","DOI":"10.1093\/oso\/9780198805090.003.0018"},{"key":"ref_43","first-page":"8577","article-title":"Modularity and community structure in networks. APS March Meeting","volume":"103","author":"Newman","year":"2006","journal-title":"Am. Phys. Soc."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1016\/j.physa.2011.08.043","article-title":"Modularity functions maximization with nonnegative relaxation facilitates community detection in networks","volume":"391","author":"Jiang","year":"2012","journal-title":"Phys. A"},{"key":"ref_45","unstructured":"Leskovec, J., and Krevl, A. (2019, August 25). SNAP Datasets: Stanford Large Network Dataset Collection. Available online: http:\/\/snap.stanford.edu\/data."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Gong, M.G., Fu, B., Jiao, L.C., and Du, H.F. (2011). Memetic algorithm for community detection in networks. Phys. Rev. E, 006100.","DOI":"10.1103\/PhysRevE.84.056101"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Danon, L., D\u00edaz-Guilera, A., Duch, J., and Arenas, A. (2005). Comparing community structure identification. J. Stat. Mech. Theory Exp., P09008.","DOI":"10.1088\/1742-5468\/2005\/09\/P09008"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"2321","DOI":"10.1007\/s00521-016-2264-1","article-title":"Characterizing the structure of large real networks to improve community detection","volume":"28","author":"Hu","year":"2017","journal-title":"Neural Comput. Appl."},{"key":"ref_49","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_50","first-page":"264","article-title":"Finding community structure in very large networks","volume":"70","author":"Clauset","year":"2010","journal-title":"Phys. Rev. E"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TKDE.2015.2496345","article-title":"Subspace based network community detection using sparse linear coding","volume":"28","author":"Mahmood","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/j.physa.2012.11.003","article-title":"Community detection based on modularity and an improved genetic;algorithm","volume":"392","author":"Shang","year":"2013","journal-title":"Phys. Stat. Mech. Its Appl."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1016\/j.neucom.2017.10.060","article-title":"Community Detection Method Based on Mixed-norm Sparse Subspace Clustering","volume":"275","author":"Tian","year":"2018","journal-title":"Neurocomputing"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.physa.2017.12.060","article-title":"Community detection using preference networks","volume":"495","author":"Tasgin","year":"2017","journal-title":"Phys. Stat. Mech. Its Appl."},{"key":"ref_55","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"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/12\/1145\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:36:56Z","timestamp":1760189816000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/12\/1145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,23]]},"references-count":55,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["e21121145"],"URL":"https:\/\/doi.org\/10.3390\/e21121145","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,23]]}}}