{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:00:14Z","timestamp":1743076814049,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_17","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"230-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Comparative Analysis of\u00a0Different Multilevel Approaches for\u00a0Community Detection"],"prefix":"10.1007","author":[{"given":"Guido","family":"Bordonaro","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6211-8675","authenticated-orcid":false,"given":"Rocco A.","family":"Scollo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7521-3516","authenticated-orcid":false,"given":"Vincenzo","family":"Cutello","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3421-3293","authenticated-orcid":false,"given":"Mario","family":"Pavone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1088\/1367-2630\/9\/6\/176","volume":"9","author":"A Arenas","year":"2007","unstructured":"Arenas, A., Duch, J., Fern\u00e1ndez, A., G\u00f3mez, S.: Size reduction of complex networks preserving modularity. New J. Phys. 9(6), 176\u2013176 (2007). https:\/\/doi.org\/10.1088\/1367-2630\/9\/6\/176","journal-title":"New J. Phys."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"10","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 10, 10008\u201310019 (2008). https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J. Stat. Mech: Theory Exp."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., et al.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172\u2013188 (2008). https:\/\/doi.org\/10.1109\/TKDE.2007.190689","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"17_CR4","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D Bu","year":"2003","unstructured":"Bu, D., et al.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443\u20132450 (2003). https:\/\/doi.org\/10.1093\/nar\/gkg340","journal-title":"Nucleic Acids Res."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.engappai.2017.05.002","volume":"62","author":"CA Coello Coello","year":"2017","unstructured":"Coello Coello, C.A., Cutello, V., Lee, D., Pavone, M.: Recent advances in immunological inspired computation. Eng. Appl. Artif. Intell. 62, 302\u2013303 (2017)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Cutello, V., Oliva, M., Pavone, M., Scollo, R.A.: An immune metaheuristics for large instances of the weighted feedback vertex set problem. In: 2019 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1928\u20131936 (2019).https:\/\/doi.org\/10.1109\/SSCI44817.2019.9002988","DOI":"10.1109\/SSCI44817.2019.9002988"},{"issue":"6","key":"17_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.3390\/a13060139","volume":"13","author":"V Cutello","year":"2020","unstructured":"Cutello, V., Fargetta, G., Pavone, M., Scollo, R.A.: Optimization algorithms for detection of social interactions. Algorithms 13(6), 139\u2013153 (2020). https:\/\/doi.org\/10.3390\/a13060139","journal-title":"Algorithms"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-14547-6","volume-title":"Artificial Immune Systems","author":"V Cutello","year":"2010","unstructured":"Cutello, V., Nicosia, G., Pavone, M., Stracquadanio, G.: An information-theoretic approach for clonal selection algorithms. In: Hart, E., McEwan, C., Timmis, J., Hone, A. (eds.) Artificial Immune Systems, pp. 144\u2013157. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-14547-6"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Di Stefano, A., Vitale, A., Cutello, V., Pavone, M.: How long should offspring lifespan be in order to obtain a proper exploration? In: 2016 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20138 (2016). https:\/\/doi.org\/10.1109\/SSCI.2016.7850270","DOI":"10.1109\/SSCI.2016.7850270"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ins.2013.09.048","volume":"260","author":"W Didimo","year":"2014","unstructured":"Didimo, W., Montecchiani, F.: Fast layout computation of clustered networks: algorithmic advances and experimental analysis. Inf. Sci. 260, 185\u2013199 (2014). https:\/\/doi.org\/10.1016\/j.ins.2013.09.048","journal-title":"Inf. Sci."},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato, S., Barth\u00e9lemy, M.: Resolution limit in community detection. Proc. Natl. Acad. Sci. 104(1), 36\u201341 (2007). https:\/\/doi.org\/10.1073\/pnas.0605965104","journal-title":"Proc. Natl. Acad. Sci."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.engappai.2016.08.014","volume":"62","author":"S Fouladvand","year":"2017","unstructured":"Fouladvand, S., Osareh, A., Shadgar, B., Pavone, M., Sharafi, S.: DENSA: an effective negative selection algorithm with flexible boundaries for self-space and dynamic number of detectors. Eng. Appl. Artif. Intell. 62, 359\u2013372 (2017). https:\/\/doi.org\/10.1016\/j.engappai.2016.08.014","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1051\/ro\/2015046","volume":"50","author":"O Gach","year":"2016","unstructured":"Gach, O., Hao, J.K.: Combined neighborhood tabu search for community detection in complex networks. RAIRO-Oper. Res. 50(2), 269\u2013283 (2016). https:\/\/doi.org\/10.1051\/ro\/2015046","journal-title":"RAIRO-Oper. Res."},{"issue":"12","key":"17_CR14","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002). https:\/\/doi.org\/10.1073\/pnas.122653799","journal-title":"Proc. Natl. Acad. Sci."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","volume":"68","author":"R Guimer\u00e0","year":"2003","unstructured":"Guimer\u00e0, R., Danon, L., D\u00edaz-Guilera, A., Giralt, F., Arenas, A.: Self-similar community structure in a network of human interactions. Phys. Rev. E 68, 065103 (2003). https:\/\/doi.org\/10.1103\/PhysRevE.68.065103","journal-title":"Phys. Rev. E"},{"issue":"10","key":"17_CR16","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1002\/bies.20820","volume":"30","author":"N Gulbahce","year":"2008","unstructured":"Gulbahce, N., Lehmann, S.: The art of community detection. BioEssays 30(10), 934\u2013938 (2008). https:\/\/doi.org\/10.1002\/bies.20820","journal-title":"BioEssays"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970). https:\/\/doi.org\/10.1002\/j.1538-7305.1970.tb01770.x","journal-title":"Bell Syst. Tech. J."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004). https:\/\/doi.org\/10.1103\/PhysRevE.69.066133","journal-title":"Phys. Rev. E"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006). https:\/\/doi.org\/10.1103\/PhysRevE.74.036104","journal-title":"Phys. Rev. E"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004). https:\/\/doi.org\/10.1103\/PhysRevE.69.026113","journal-title":"Phys. Rev. E"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-02011-7_24","volume-title":"Experimental Algorithms","author":"A Noack","year":"2009","unstructured":"Noack, A., Rotta, R.: Multi-level algorithms for modularity clustering. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 257\u2013268. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02011-7_24"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s10898-011-9736-8","volume":"53","author":"M Pavone","year":"2012","unstructured":"Pavone, M., Narzisi, G., Nicosia, G.: Clonal selection: an immunological algorithm for global optimization over continuous spaces. J. Global Optim. 53, 769\u2013808 (2012). https:\/\/doi.org\/10.1007\/s10898-011-9736-8","journal-title":"J. Global Optim."},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"046112","DOI":"10.1103\/PhysRevE.77.046112","volume":"77","author":"P Schuetz","year":"2008","unstructured":"Schuetz, P., Caflisch, A.: Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E 77, 046112 (2008). https:\/\/doi.org\/10.1103\/PhysRevE.77.046112","journal-title":"Phys. Rev. E"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-77091-4_7","volume-title":"AIxIA 2020 \u2013 Advances in Artificial Intelligence","author":"RA Scollo","year":"2021","unstructured":"Scollo, R.A., Cutello, V., Pavone, M.: Where the local search affects best in an immune algorithm. In: Baldoni, M., Bandini, S. (eds.) AIxIA 2020. LNCS (LNAI), vol. 12414, pp. 99\u2013114. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77091-4_7"},{"key":"17_CR25","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-030-29933-0_20","volume-title":"Advances in Computational Intelligence Systems","author":"AG Spampinato","year":"2020","unstructured":"Spampinato, A.G., Scollo, R.A., Cavallaro, S., Pavone, M., Cutello, V.: An immunological algorithm for graph modularity optimization. In: Ju, Z., Yang, L., Yang, C., Gegov, A., Zhou, D. (eds.) UKCI 2019. AISC, vol. 1043, pp. 235\u2013247. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29933-0_20"},{"issue":"6684","key":"17_CR26","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u201csmall-world\u2019\u2019 networks. Nature 393(6684), 440\u2013442 (1998). https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:04:04Z","timestamp":1688198644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}