{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:20:02Z","timestamp":1780053602359,"version":"3.54.0"},"reference-count":34,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Community detection is one of the most challenging and interesting problems in many research areas. Being able to detect highly linked communities in a network can lead to many benefits, such as understanding relationships between entities or interactions between biological genes, for instance. Two different immunological algorithms have been designed for this problem, called Opt-IA and Hybrid-IA, respectively. The main difference between the two algorithms is the search strategy and related immunological operators developed: the first carries out a random search together with purely stochastic operators; the last one is instead based on a deterministic Local Search that tries to refine and improve the current solutions discovered. The robustness of Opt-IA and Hybrid-IA has been assessed on several real social networks. These same networks have also been considered for comparing both algorithms with other seven different metaheuristics and the well-known greedy optimization Louvain algorithm. The experimental analysis conducted proves that Opt-IA and Hybrid-IA are reliable optimization methods for community detection, outperforming all compared algorithms.<\/jats:p>","DOI":"10.3390\/a13060139","type":"journal-article","created":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T05:02:24Z","timestamp":1591938144000},"page":"139","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Optimization Algorithms for Detection of Social Interactions"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7521-3516","authenticated-orcid":false,"given":"Vincenzo","family":"Cutello","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Catania, Viale Andrea Doria 6, 95125 Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6444-1564","authenticated-orcid":false,"given":"Georgia","family":"Fargetta","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Catania, Viale Andrea Doria 6, 95125 Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3421-3293","authenticated-orcid":false,"given":"Mario","family":"Pavone","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Catania, Viale Andrea Doria 6, 95125 Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6211-8675","authenticated-orcid":false,"given":"Rocco A.","family":"Scollo","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Catania, Viale Andrea Doria 6, 95125 Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2020,6,11]]},"reference":[{"key":"ref_1","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_2","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1002\/bies.20820","article-title":"The art of community detection","volume":"30","author":"Gulbahce","year":"2008","journal-title":"BioEssays"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.ins.2013.09.048","article-title":"Fast layout computation of clustered networks: Algorithmic advances and experimental analysis","volume":"260","author":"Didimo","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","article-title":"On Modularity Clustering","volume":"20","author":"Brandes","year":"2008","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman","year":"2006","journal-title":"Phys. Rev. E"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Talbi, E.G. (2009). Metaheuristics: From Design to Implementation, Wiley.","DOI":"10.1002\/9780470496916"},{"key":"ref_9","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"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.engappai.2016.08.014","article-title":"DENSA: An effective negative selection algorithm with flexible boundaries for self-space and dynamic number of detectors","volume":"62","author":"Fouladvand","year":"2017","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1007\/s10898-011-9736-8","article-title":"Clonal selection: An immunological algorithm for global optimization over continuous spaces","volume":"53","author":"Pavone","year":"2012","journal-title":"J. Glob. Optim."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Cutello, V., Oliva, M., Pavone, M., and Scollo, R.A. (2019, January 6\u20139). An Immune Metaheuristics for Large Instances of the Weighted Feedback Vertex Set Problem. Proceedings of the 2019 IEEE Symposium Series on Computational Intelligence (SSCI), Xiamen, China.","DOI":"10.1109\/SSCI44817.2019.9002988"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Di Stefano, A., Vitale, A., Cutello, V., and Pavone, M. (2016, January 6\u20139). How long should offspring lifespan be in order to obtain a proper exploration?. Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence (SSCI), Athens, Greece.","DOI":"10.1109\/SSCI.2016.7850270"},{"key":"ref_14","first-page":"235","article-title":"An Immunological Algorithm for Graph Modularity Optimization","volume":"Volume 1043","author":"Ju","year":"2020","journal-title":"Advances in Computational Intelligence Systems"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/s00442-006-0553-6","article-title":"Network metrics reveal differences in social organization between two fission\u2013fusion species, Grevy\u2019s zebra and onager","volume":"151","author":"Sundaresan","year":"2007","journal-title":"Oecologia"},{"key":"ref_17","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_18","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_19","unstructured":"Krebs, V. (2020, April 08). A Network of Books about Recent US Politics Sold by the Online Bookseller Amazon.com. Available online: http:\/\/www.orgnet.com."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","article-title":"Community structure in Jazz","volume":"6","author":"Gleiser","year":"2003","journal-title":"Adv. Complex Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"10","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.cageo.2011.12.011","article-title":"Transforming geocentric cartesian coordinates to geodetic coordinates by using differential search algorithm","volume":"46","author":"Civicioglu","year":"2012","journal-title":"Comput. Geosci."},{"key":"ref_23","unstructured":"Storn, R., and Price, K. (1995). Differential Evolution: A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces, International Computer Science Institute. Technical Report TR-95-012."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential Evolution\u2014A Simple and Efficient Heuristic for global Optimization over Continuous Spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristics for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1977","journal-title":"Decis. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.ejor.2004.08.004","article-title":"Principles of scatter search","volume":"169","author":"Laguna","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.advengsoft.2005.04.005","article-title":"A new optimization method: Big Bang\u2013Big Crunch","volume":"37","author":"Erol","year":"2006","journal-title":"Adv. Eng. Softw."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Gonz\u00e1lez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., and Krasnogor, N. (2010). A New Metaheuristic Bat-Inspired Algorithm. Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), Springer.","DOI":"10.1007\/978-3-642-12538-6"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","article-title":"GSA: A Gravitational Search Algorithm","volume":"179","author":"Rashedi","year":"2009","journal-title":"Inf. Sci."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-319-13359-1_25","article-title":"MA-Net: A Reliable Memetic Algorithm for Community Detection by Modularity Optimization","volume":"Volume 1","author":"Handa","year":"2015","journal-title":"Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.asoc.2016.11.025","article-title":"Community detection from biological and social networks: A comparative analysis of metaheuristic algorithms","volume":"50","author":"Atay","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"016118","DOI":"10.1103\/PhysRevE.80.016118","article-title":"Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities","volume":"80","author":"Lancichinetti","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_33","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_34","doi-asserted-by":"crossref","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","article-title":"Comparing community structure identification","volume":"2005","author":"Danon","year":"2005","journal-title":"J. Stat. Mech. Theory Exp."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/6\/139\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:37:43Z","timestamp":1760175463000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/6\/139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,11]]},"references-count":34,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2020,6]]}},"alternative-id":["a13060139"],"URL":"https:\/\/doi.org\/10.3390\/a13060139","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,11]]}}}