{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T07:25:56Z","timestamp":1772609156229,"version":"3.50.1"},"reference-count":51,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:00:00Z","timestamp":1556755200000},"content-version":"vor","delay-in-days":121,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602225"],"award-info":[{"award-number":["61602225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>Community structures can reveal organizations and functional properties of complex networks; hence, detecting communities from networks is of great importance. With the surge of large networks in recent years, the efficiency of community detection is demanded critically. Therefore, many local methods have emerged. In this paper, we propose a node similarity based community detection method, which is also a local one consisted of two phases. In the first phase, we first take out the node with the largest degree from the network to take it as an exemplar of the first community and insert its most similar neighbor node into the community as well. Then, the one with the largest degree in the remainder nodes is selected; if its most similar neighbor has not been classified into any community yet, we create a new community for the selected node and its most similar neighbor. Otherwise, if its most similar neighbor has been classified into a certain community, we insert the selected node into the community to which its most similar neighbor belongs. This procedure is repeated until every node in the network is assigned to a community; at that time, we obtain a series of preliminary communities. However, some of them might be too small or too sparse; edges connecting to outside of them might go beyond the ones inside them. Keeping them as the final ones will lead to a low\u2010quality community structure. Therefore, we merge some of them in an efficient approach in the second phase to improve the quality of the resulting community structure. To testify the performance of our proposed method, extensive experiments are performed on both some artificial networks and some real\u2010world networks. The results show that the proposed method can detect high\u2010quality community structures from networks steadily and efficiently and outperform the comparison algorithms significantly.<\/jats:p>","DOI":"10.1155\/2019\/8292485","type":"journal-article","created":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T23:37:53Z","timestamp":1556840273000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Neighbor Similarity Based Agglomerative Method for Community Detection in Networks"],"prefix":"10.1155","volume":"2019","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0044-0861","authenticated-orcid":false,"given":"Jianjun","family":"Cheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9555-2101","authenticated-orcid":false,"given":"Xing","family":"Su","sequence":"additional","affiliation":[]},{"given":"Haijuan","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5866-617X","authenticated-orcid":false,"given":"Longjie","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jingming","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shiyan","family":"Zhao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1476-0951","authenticated-orcid":false,"given":"Xiaoyun","family":"Chen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2019,5,2]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1067014"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2010.01.001"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073374"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature03288"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219525903001067"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/120882093"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"e_1_2_10_15_2","doi-asserted-by":"crossref","unstructured":"LusseauD. The emergent properties of a dolphin social network 270 Proceedings of the Royal Society of London B: Biological Sciences 2003 no. supplement 2 S186\u2013S188 https:\/\/doi.org\/10.1098\/rsbl.2003.0057 2-s2.0-0242490500.","DOI":"10.1098\/rsbl.2003.0057"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.11.001"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1038\/35036627"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.70.056122"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.02.212"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2013-40829-0"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.026129"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep45836"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.02.174"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"e_1_2_10_33_2","doi-asserted-by":"crossref","unstructured":"XuX. YurukN. FengZ. andSchweigerT. A. J. SCAN: A structural clustering algorithm for networks Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201907) August 2007 New York NY USA ACM 824\u2013833 2-s2.0-36949010345.","DOI":"10.1145\/1281192.1281280"},{"key":"e_1_2_10_34_2","unstructured":"EsteM. KriegelH. P. J\u00f6rgS. andXux. A density-based algorithm for discovering clusters in large spatial databases with noise Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD\u201996) 1996 AAAI Press 226\u2013231."},{"key":"e_1_2_10_35_2","unstructured":"ShiokawaH. FujiwaraY. andOnizukaM. Scan++: Efficient algorithm for finding clusters hubs and outliers on large-scale graphs Proceedings of the 3rd Workshop on Spatio-Temporal Database Management STDBM 2006 Co-located with the 32nd International Conference on Very Large Data Bases VLDB 2006 September 2006 Republic of Korea 1178\u20131189 2-s2.0-84948441647."},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.07.025"},{"key":"e_1_2_10_37_2","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0169355","article-title":"Locating structural centers: A density-based clustering method for community detection","volume":"12","author":"Wang X.","year":"2017","journal-title":"PLoS ONE"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/11569596_31"},{"key":"e_1_2_10_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.07.021"},{"key":"e_1_2_10_40_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep41830"},{"key":"e_1_2_10_41_2","doi-asserted-by":"crossref","unstructured":"ShaoJ. HanZ. YangQ. andZhouT. Community detection based on distance dynamics Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining August 2015 Australia ACM 1075\u20131084 2-s2.0-84954153806.","DOI":"10.1145\/2783258.2783301"},{"key":"e_1_2_10_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.12.099"},{"key":"e_1_2_10_43_2","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1138"},{"key":"e_1_2_10_44_2","doi-asserted-by":"publisher","DOI":"10.3389\/fncom.2013.00189"},{"key":"e_1_2_10_45_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1312486110"},{"key":"e_1_2_10_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71249-9_39"},{"key":"e_1_2_10_47_2","series-title":"Studies in Computational Intelligence","first-page":"278","volume-title":"International Workshop on Complex Networks and their Applications","author":"Tackx R.","year":"2017"},{"key":"e_1_2_10_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.08.090"},{"key":"e_1_2_10_49_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep18374"},{"key":"e_1_2_10_50_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"e_1_2_10_51_2","doi-asserted-by":"crossref","unstructured":"AnaL.andJainA. Robust data clustering 2 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition 2003 Madison WI USA II-128\u2013II-133 https:\/\/doi.org\/10.1109\/CVPR.2003.1211462.","DOI":"10.1109\/CVPR.2003.1211462"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/8292485.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2019\/8292485.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2019\/8292485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T14:22:34Z","timestamp":1723040554000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2019\/8292485"}},"subtitle":[],"editor":[{"given":"Guang","family":"Li","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1155\/2019\/8292485"],"URL":"https:\/\/doi.org\/10.1155\/2019\/8292485","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"2018-12-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-04-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-05-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8292485"}}