{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:37:33Z","timestamp":1777703853388,"version":"3.51.4"},"reference-count":29,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T00:00:00Z","timestamp":1530144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2018,7,27]]},"abstract":"<jats:p>Community detection aims to discover cohesive groups in which people connect with each other closely in social networks. A variety of methods have been proposed to detect communities in social networks. However, there is still few work to make a comparative study on those methods. In this paper, we first introduce and compare several representative methods on community detection. Then we implement those methods with python and make a comparative analysis on different real world social networking data sets. The experimental results have shown that GN algorithm is suitable for small networks, while LPA algorithm has a better scalability. FU algorithm is of the best stability. This work could help researchers to understand the ideas of community detection methods better and select appropriate method on demand more easily.<\/jats:p>","DOI":"10.3233\/jifs-17682","type":"journal-article","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T16:41:12Z","timestamp":1530290472000},"page":"1077-1086","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":29,"title":["A comparative study on community detection methods in complex networks"],"prefix":"10.1177","volume":"35","author":[{"given":"Zhongying","family":"Zhao","sequence":"first","affiliation":[{"name":"College of Computer Science and Engineering, Shandong Province Key laboratory of Wisdom Mine Information Technology, Shandong University of Science and Technology, Qingdao, China"},{"name":"Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China"}]},{"given":"Shaoqiang","family":"Zheng","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Shandong Province Key laboratory of Wisdom Mine Information Technology, Shandong University of Science and Technology, Qingdao, China"}]},{"given":"Chao","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Shandong Province Key laboratory of Wisdom Mine Information Technology, Shandong University of Science and Technology, Qingdao, China"}]},{"given":"Jinqing","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Shandong Province Key laboratory of Wisdom Mine Information Technology, Shandong University of Science and Technology, Qingdao, China"}]},{"given":"Liang","family":"Chang","sequence":"additional","affiliation":[{"name":"Guangxi Key Lab of Trusted Software, Guilin University of Electronic Technology, Guilin, China"}]},{"given":"Francisco","family":"Chiclana","sequence":"additional","affiliation":[{"name":"Center for Computational Intelligence, Faculty of Technology, De Montfort University, Leicester, UK"}]}],"member":"179","published-online":{"date-parts":[[2018,6,28]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2016.7389831"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.4018\/IJDWM.2015070105"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-161622"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.06.014"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.06.042"},{"key":"e_1_3_2_7_2","unstructured":"ZhanQ. ZhangJ. YuP. and XieJ. Community detection for emerging social networks WorldWideWeb-internet & Web Information Systems (2017) 1\u201333."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.07.017"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.07.007"},{"issue":"10","key":"e_1_3_2_11_2","first-page":"2140","article-title":"Community mining in complex networks","volume":"50","author":"Liu D.","year":"2013","unstructured":"LiuD., JinD., HeD., HuangJ., YangJ. and YangB., Community mining in complex networks, Journal of Computer Research & Development 50(10) (2013), 2140\u20132154.","journal-title":"Journal of Computer Research & Development"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"AroraS. RaoS. and VaziraniU. Expander flows geometric embeddings and graph partitioning in: Thirty-Sixth ACM Symposium on Theory of Computing 2004 pp. 222\u2013231.","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2007.05.001"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"e_1_3_2_17_2","first-page":"475","article-title":"Local graph partitioning using pagerank vectors","author":"Andersen R.","year":"2006","unstructured":"AndersenR., FanC. and LangK., Local graph partitioning using pagerank vectors, in: IEEE Symposium on Foundations of Computer Science, 2006, pp. 475\u2013486.","journal-title":"IEEE Symposium on Foundations of Computer Science"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0400054101"},{"key":"e_1_3_2_19_2","doi-asserted-by":"crossref","unstructured":"LeskovecJ. LangK.J. and MahoneyM.W. Empirical comparison of algorithms for network community detection (2010) pp. 631\u2013640.","DOI":"10.1145\/1772690.1772755"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","unstructured":"TylerJ.R. WilkinsonD.M. and HubermanB.A. E-Mail as Spectroscopy: Automated Discovery of Community Structure within Organizations Springer Netherlands 2003.","DOI":"10.1007\/978-94-017-0115-0_5"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.026129"},{"key":"e_1_3_2_26_2","first-page":"1118","article-title":"Maps of information flow reveal community structure in complex networks","author":"Rosvall M.","year":"2007","unstructured":"RosvallM. and BergstromC.T., Maps of information flow reveal community structure in complex networks, Proceedings of the National Academy of Sciences USA (2007), 1118\u20131123.","journal-title":"Proceedings of the National Academy of Sciences USA"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0181-y"},{"key":"e_1_3_2_29_2","doi-asserted-by":"crossref","unstructured":"YangJ. and LeskovecJ. Overlapping community detection at scale: A nonnegative matrix factorization approach in: ACM International Conference onWeb Search and Data Mining 2013 pp. 587\u2013596.","DOI":"10.1145\/2433396.2433471"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1527286.1527287"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-17682","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-17682","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-17682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:39:47Z","timestamp":1777455587000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-17682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,28]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7,27]]}},"alternative-id":["10.3233\/JIFS-17682"],"URL":"https:\/\/doi.org\/10.3233\/jifs-17682","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,28]]}}}