{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:00:09Z","timestamp":1753887609657,"version":"3.41.2"},"reference-count":52,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"vor","delay-in-days":71,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004775","name":"Natural Science Foundation of Gansu Province","doi-asserted-by":"publisher","award":["20JR5RA284"],"award-info":[{"award-number":["20JR5RA284"]}],"id":[{"id":"10.13039\/501100004775","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Community structure is one of the common characteristics of complex networks. In the practical work, we have noted that every node and its most similar node tend to be assigned to the same community and that two communities are often merged together if there exist relatively more edges between them. Inspired by these observations, we present a community\u2010detection method named <jats:italic>NSCLS<\/jats:italic> in this paper. Firstly, we calculate the similarities between any node and its first\u2010 and second\u2010order neighbors in a novel way and then extract the initial communities from the network by allocating every node and its most similar node to the same community. In this procedure, some nodes located at the community boundaries might be classified in the incorrect communities. To make a redemption, we adjust their community affiliations by reclassifying each of them into the community in which most of its neighbors have been. After that, there might exist relatively larger number of edges between some communities. Therefore, we consider to merge such communities to improve the quality of the final community structure further. To this end, we calculate the <jats:italic>link strength<\/jats:italic> between communities and merge some densely connected communities based on this index. We evaluate NSCLS on both some synthetic networks and some real\u2010world networks and show that it can detect high\u2010quality community structures from various networks, and its results are much better than the counterparts of comparison algorithms.<\/jats:p>","DOI":"10.1155\/2021\/8848566","type":"journal-article","created":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T18:35:08Z","timestamp":1615660508000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Node Similarity and Community Link Strength\u2010Based Community Discovery Algorithm"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3439-9131","authenticated-orcid":false,"given":"Haijuan","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0044-0861","authenticated-orcid":false,"given":"Jianjun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Handong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1476-0951","authenticated-orcid":false,"given":"Xiaoyun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,3,13]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2010.01.001"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature03288"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.69.026113"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep30750"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-017-0023-6"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0238-9"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0232-2"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.70.066111"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.74.036104"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/p10008"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-41695-z"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.76.036106"},{"key":"e_1_2_9_15_2","doi-asserted-by":"crossref","unstructured":"XieJ.andSzymanskiB. K. Labelrank: A stabilized label propagation algorithm for community detection in networks Proceedings of the 2013 IEEE 2nd Network Science Workshop (NSW) April 2013 West point NY USA 138\u2013143.","DOI":"10.1109\/NSW.2013.6609210"},{"key":"e_1_2_9_16_2","doi-asserted-by":"crossref","unstructured":"ThakareS. B.andKiwelekarA. W. Skiplpa: An efficient label propagation algorithm for community detection in sparse network Proceedings of the 9th Annual ACM India Conference ser. COMPUTE \u201916 October 2016 New York NY USA ACM.","DOI":"10.1145\/2998476.2998486"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0210-8"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"e_1_2_9_19_2","doi-asserted-by":"crossref","unstructured":"PonsP.andLatapyM. Computing communities in large networks using random walks Proceedings of the International Symposium on Computer and Information Sciences October 2005 Istanbul Turkey Springer 284\u2013293.","DOI":"10.1007\/11569596_31"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.07.021"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep41830"},{"key":"e_1_2_9_22_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 Sydney Australia ACM 1075\u20131084.","DOI":"10.1145\/2783258.2783301"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2859788"},{"key":"e_1_2_9_24_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 ser. KDD \u201907 August 2007 New York NY USA ACM 824\u2013833.","DOI":"10.1145\/1281192.1281280"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.07.025"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0169355"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.03.006"},{"key":"e_1_2_9_29_2","doi-asserted-by":"crossref","unstructured":"AlfalahiK. AtifY. andHarousS. Community detection in social networks through similarity virtual networks Proceedings of the 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining Ser. ASONAM\u201913 August 2013 New York NY USA Association for Computing Machinery 1116\u20131123.","DOI":"10.1145\/2492517.2500299"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2937580"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11063-019-10170-1"},{"key":"e_1_2_9_32_2","unstructured":"KondorR. I.andLaffertyJ. D. Diffusion kernels on graphs and other discrete input spaces Proceedings of the Nineteenth International Conference on Machine Learning Ser. ICML \u201902 July 2002 San Francisco CA USA Morgan Kaufmann Publishers Inc. 315\u2013322."},{"key":"e_1_2_9_33_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.73.026120"},{"key":"e_1_2_9_34_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1136800"},{"key":"e_1_2_9_35_2","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"e_1_2_9_36_2","doi-asserted-by":"publisher","DOI":"10.1098\/rsbl.2003.0057"},{"key":"e_1_2_9_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.11.001"},{"key":"e_1_2_9_38_2","doi-asserted-by":"publisher","DOI":"10.1137\/s003614450342480"},{"key":"e_1_2_9_39_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.1142\/s0219525903001067"},{"key":"e_1_2_9_41_2","doi-asserted-by":"publisher","DOI":"10.1038\/35036627"},{"key":"e_1_2_9_42_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.68.065103"},{"key":"e_1_2_9_43_2","doi-asserted-by":"crossref","unstructured":"AdamicL. A. The political blogosphere and the 2004 u.s. election: divided they blog Proceedings of the International Workshop on Link Discovery January 2005 Moscow Russia.","DOI":"10.1145\/1134271.1134277"},{"key":"e_1_2_9_44_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_2_9_45_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_2_9_46_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.70.056122"},{"key":"e_1_2_9_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_2_9_48_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/08\/p08001"},{"key":"e_1_2_9_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.10.018"},{"key":"e_1_2_9_50_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-44892-y"},{"key":"e_1_2_9_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2020.04.124"},{"key":"e_1_2_9_52_2","unstructured":"AnaL. N. F.andJainA. K. Robust data clustering Proceedings of the 2003 IEEE computer society conference on computer vision and pattern recognition June 2003 Madison Wisconsin."}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/8848566.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/8848566.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/8848566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:52:15Z","timestamp":1723243935000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/8848566"}},"subtitle":[],"editor":[{"given":"Hocine","family":"Cherifi","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/8848566"],"URL":"https:\/\/doi.org\/10.1155\/2021\/8848566","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-09-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"8848566"}}