{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:54:32Z","timestamp":1747191272205,"version":"3.40.5"},"reference-count":69,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T00:00:00Z","timestamp":1677542400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2023,2,28]]},"abstract":"<jats:p>Detecting communities in complex networks can shed light on the essential characteristics and functions of the modeled phenomena. This topic has attracted researchers from both academia and industry. Among different community detection methods, genetic algorithms (GAs) have become popular. Considering the drawbacks of the currently used locus-based and solution-vector-based encodings to represent the individuals, in this article, we propose (1) a new node similarity-based encoding method, MST-based encoding, to represent a network partition as an individual, which can avoid the shortcomings of the previous encoding schemes. Then, we propose (2) a new adaptive genetic algorithm for the purpose of detecting communities in networks, along with (3) a new initial population generation function to improve the convergence time of the algorithm, and (4) a new sine-based adaptive mutation function which adjusts the mutations according to the improvement in the fitness value of the best individual in the population pool. The proposed method combines the similarity-based and modularity-optimization-based approaches to find communities in complex networks in an evolutionary framework. Besides the fact that the proposed encoding can avoid meaningless mutations or disconnected communities, we show that the new initial population generation function and the new adaptive mutation function can improve the convergence time of the algorithm. Several experiments and comparisons were conducted to verify the effectiveness of the proposed method using modularity and NMI measures on both real-world and synthetic datasets. The results show that the proposed method can find the communities in a significantly shorter time than other GAs while reaching a better trade-off in the different measures.<\/jats:p>","DOI":"10.1155\/2023\/4796536","type":"journal-article","created":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T13:50:07Z","timestamp":1677592207000},"page":"1-22","source":"Crossref","is-referenced-by-count":1,"title":["Detecting Communities in Complex Networks Using an Adaptive Genetic Algorithm and Node Similarity-Based Encoding"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4886-8995","authenticated-orcid":true,"given":"Sajjad","family":"Hesamipour","sequence":"first","affiliation":[{"name":"University of Tabriz, Department of Computer Engineering, Faculty of Electrical & Computer Engineering, Tabriz, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5898-0871","authenticated-orcid":true,"given":"Mohammad Ali","family":"Balafar","sequence":"additional","affiliation":[{"name":"University of Tabriz, Department of Computer Engineering, Faculty of Electrical & Computer Engineering, Tabriz, Iran"}]},{"given":"Saeed","family":"Mousazadeh","sequence":"additional","affiliation":[{"name":"University of Tabriz, Department of Computer Engineering, Faculty of Electrical & Computer Engineering, Tabriz, Iran"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01962-3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2019.04.042"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1142\/s0217984920504084"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.69.026113"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1504\/ijbic.2016.076329"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.84.066122"},{"article-title":"A classification for community discovery methods in complex networks","year":"2012","author":"M. Coscia","key":"7"},{"article-title":"Community detection based on link prediction methods","year":"2016","author":"H.-M. Cheng","key":"8"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.122354"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1080\/03081079.2020.1863394"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.76.036106"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102716"},{"article-title":"Network flows and the link prediction problem","author":"K. Narang","key":"13","doi-asserted-by":"crossref","DOI":"10.1145\/2501025.2501031"},{"first-page":"982","article-title":"Fast heuristic algorithm for multi-scale hierarchical community detection","author":"E. Castrillo","key":"14"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.01.028"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.02.018"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0706851105"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2014.10.002"},{"article-title":"Community detection in complex networks using genetic algorithms","year":"2007","author":"M. Tasgin","key":"19"},{"article-title":"Community detection in complex networks using genetic algorithm","year":"2006","author":"M. Tasgin","key":"20"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.10.005"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.3390\/pr7020111"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2012.03.021"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100629"},{"key":"25","first-page":"1081","article-title":"A genetic algorithm for community detection in social networks","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"C. P.. Ga-net","year":"2008"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1177\/0165551516657717"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12273"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.70.066111"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/p10008"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-41695-z"},{"first-page":"479","article-title":"Edmot. An edge enhancement approach for motif-aware community detection","author":"P.-Z. Li","key":"31"},{"article-title":"Local-global graph clustering with applications in sense and frame induction","year":"2018","author":"D. Ustalov","key":"32"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.11.110"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.11.014"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.05.014"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.01.015"},{"key":"37","first-page":"236","article-title":"A new reduced-length genetic representation for evolutionary multiobjective clustering","volume-title":"Heike Trautmann, G\u00fcnter Rudolph, Kathrin Klamroth, Oliver Sch\u00fctze, Margaret Wiecek","author":"M. Garza-Fabre","year":"2017"},{"first-page":"3","article-title":"Incremental cluster evolution tracking from highly dynamic network data","author":"P. Lee","key":"38"},{"first-page":"477","article-title":"Skeleton construction in mobile social networks. Algorithms and applications","author":"Z. Lu","key":"39"},{"first-page":"118","article-title":"A skeleton-based community detection algorithm for directed networks","author":"H. Long","key":"40"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"44","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des alpes et des jura","volume":"37","author":"J. Paul","year":"1901","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"volume-title":"Introduction To Modern Information Retrieval Mcgraw Hill Book Company","year":"1983","author":"G. Salton","key":"45"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073374"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1016\/s0378-8733(03)00009-1"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.122950"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/89\/58007"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1142\/s0217979220500186"},{"volume-title":"Adaptation in Natural and Artificial Systems","year":"1976","author":"J. R. Sampson","key":"52"},{"key":"53","doi-asserted-by":"publisher","DOI":"10.1109\/3477.678624"},{"key":"54","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2017.01.018"},{"key":"55","doi-asserted-by":"publisher","DOI":"10.21917\/ijsc.2015.0150"},{"key":"56","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.063"},{"key":"57","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"article-title":"Books about us politics. unpublished","year":"2004","author":"V. Krebs","key":"60"},{"first-page":"36","article-title":"The political blogosphere and the 2004 u.s. election. Divided they blog","author":"A. Lada","key":"61"},{"key":"62","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"63","doi-asserted-by":"publisher","DOI":"10.1142\/s0219525903001067"},{"key":"64","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.70.056122"},{"key":"65","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"66","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.78.046110"},{"first-page":"229","article-title":"Fluid communities. a competitive, scalable and diverse community detection algorithm","author":"F. Par\u00e9s","key":"67"},{"key":"68","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-020-00647-6"},{"article-title":"Detecting communities in complex networks using an adaptive genetic algorithm and node similarity-based encoding","year":"2022","author":"S. Hesamipour","key":"69"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/4796536.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/4796536.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2023\/4796536.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T13:50:14Z","timestamp":1677592214000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2023\/4796536\/"}},"subtitle":[],"editor":[{"given":"Dan","family":"Seli\u015fteanu","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,2,28]]},"references-count":69,"alternative-id":["4796536","4796536"],"URL":"https:\/\/doi.org\/10.1155\/2023\/4796536","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2023,2,28]]}}}