{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T18:58:32Z","timestamp":1784228312005,"version":"3.55.0"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"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":["Computing"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00607-023-01157-x","type":"journal-article","created":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T02:03:37Z","timestamp":1674785017000},"page":"1523-1546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A novel discrete ICO algorithm for influence maximization in complex networks"],"prefix":"10.1007","volume":"105","author":[{"given":"Vahideh","family":"Sahargahi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2433-115X","authenticated-orcid":false,"given":"Vahid","family":"Majidnezhad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saeid","family":"Taghavi Afshord","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yasser","family":"Jafari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,27]]},"reference":[{"key":"1157_CR1","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg, J, and Tardos \u00c9 (2003) Maximizing the spread of influence through a social network,. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, Washington, D.C. [Online]. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"issue":"4","key":"1157_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00527ED1V01Y201308DTM037","volume":"5","author":"W Chen","year":"2013","unstructured":"Chen W, Lakshmanan LVS, Castillo C (2013) Information and influence propagation in social networks. Synth Lect Data Manag 5(4):1\u2013177. https:\/\/doi.org\/10.2200\/S00527ED1V01Y201308DTM037","journal-title":"Synth Lect Data Manag"},{"issue":"3","key":"1157_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Market Lett 12(3):211\u2013223","journal-title":"Market Lett"},{"key":"1157_CR4","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web. https:\/\/doi.org\/10.1145\/1232722.1232727","journal-title":"ACM Trans Web"},{"key":"1157_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.comnet.2017.05.004","volume":"123","author":"P Wu","year":"2017","unstructured":"Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38\u201350. https:\/\/doi.org\/10.1016\/j.comnet.2017.05.004","journal-title":"Comput Netw"},{"key":"1157_CR6","doi-asserted-by":"crossref","unstructured":"Ye M, Liu X, and Lee W-C (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th international ACM SIGIR conference on research and development in information retrieval, Portland, Oregon, USA [Online]. https:\/\/doi.org\/10.1145\/2348283.2348373","DOI":"10.1145\/2348283.2348373"},{"key":"1157_CR7","doi-asserted-by":"crossref","unstructured":"Song X, Tseng B, Lin C-Y, Sun M-T (2006) Personalized recommendation driven by information flow. In: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pp 509\u2013516","DOI":"10.1145\/1148170.1148258"},{"key":"1157_CR8","doi-asserted-by":"publisher","first-page":"108126","DOI":"10.1016\/j.asoc.2021.108126","volume":"115","author":"V Sahargahi","year":"2022","unstructured":"Sahargahi V, Majidnezhad V, Afshord ST, Jafari Y (2022) An intelligent chaotic clonal optimizer. Appl Soft Comput 115:108126","journal-title":"Appl Soft Comput"},{"key":"1157_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.asoc.2019.04.017","volume":"80","author":"IM Ali","year":"2019","unstructured":"Ali IM, Essam D, Kasmarik K (2019) A novel differential evolution mapping technique for generic combinatorial optimization problems. Appl Soft Comput 80:297\u2013309","journal-title":"Appl Soft Comput"},{"key":"1157_CR10","doi-asserted-by":"publisher","first-page":"106734","DOI":"10.1016\/j.asoc.2020.106734","volume":"98","author":"Z-K Feng","year":"2021","unstructured":"Feng Z-K, Niu W-J, Liu S (2021) Cooperation search algorithm: a novel metaheuristic evolutionary intelligence algorithm for numerical optimization and engineering optimization problems. Appl Soft Comput 98:106734","journal-title":"Appl Soft Comput"},{"key":"1157_CR11","doi-asserted-by":"publisher","first-page":"105190","DOI":"10.1016\/j.knosys.2019.105190","volume":"191","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A, Heidarinejad M, Stephens B, Mirjalili S (2020) Equilibrium optimizer: a novel optimization algorithm. Knowl-Based Syst 191:105190","journal-title":"Knowl-Based Syst"},{"issue":"13","key":"1157_CR12","doi-asserted-by":"publisher","first-page":"8129","DOI":"10.1007\/s00500-021-05734-0","volume":"25","author":"F Asef","year":"2021","unstructured":"Asef F, Majidnezhad V, Feizi-Derakhshi M-R, Parsa S (2021) Heat transfer relation-based optimization algorithm (HTOA). Soft Comput 25(13):8129\u20138158","journal-title":"Soft Comput"},{"key":"1157_CR13","doi-asserted-by":"publisher","first-page":"113609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S, Abd Elaziz M, Gandomi AH (2021) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:113609","journal-title":"Comput Methods Appl Mech Eng"},{"key":"1157_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-020-02809-y","author":"ME Kivi","year":"2021","unstructured":"Kivi ME, Majidnezhad V (2021) A novel swarm intelligence algorithm inspired by the grazing of sheep. J Ambient Intell Humaniz Comput. https:\/\/doi.org\/10.1007\/s12652-020-02809-y","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1157_CR15","doi-asserted-by":"publisher","first-page":"106391","DOI":"10.1016\/j.asoc.2020.106391","volume":"93","author":"X Chu","year":"2020","unstructured":"Chu X et al (2020) An artificial bee colony algorithm with adaptive heterogeneous competition for global optimization problems. Appl Soft Comput 93:106391","journal-title":"Appl Soft Comput"},{"issue":"8","key":"1157_CR16","doi-asserted-by":"publisher","first-page":"6179","DOI":"10.1007\/s00500-021-05606-7","volume":"25","author":"N Kumar","year":"2021","unstructured":"Kumar N, Singh N, Vidyarthi DP (2021) Artificial lizard search optimization (ALSO): a novel nature-inspired meta-heuristic algorithm. Soft Comput 25(8):6179\u20136201","journal-title":"Soft Comput"},{"key":"1157_CR17","doi-asserted-by":"publisher","first-page":"106503","DOI":"10.1016\/j.asoc.2020.106503","volume":"95","author":"E Bogar","year":"2020","unstructured":"Bogar E, Beyhan S (2020) Adolescent identity search algorithm (AISA): a novel metaheuristic approach for solving optimization problems. Appl Soft Comput 95:106503","journal-title":"Appl Soft Comput"},{"key":"1157_CR18","doi-asserted-by":"publisher","first-page":"105075","DOI":"10.1016\/j.engappai.2022.105075","volume":"114","author":"S Zhao","year":"2022","unstructured":"Zhao S, Zhang T, Ma S, Chen M (2022) Dandelion Optimizer: a nature-inspired metaheuristic algorithm for engineering applications. Eng Appl Artif Intell 114:105075","journal-title":"Eng Appl Artif Intell"},{"key":"1157_CR19","doi-asserted-by":"publisher","first-page":"108816","DOI":"10.1016\/j.asoc.2022.108816","volume":"122","author":"P Zhang","year":"2022","unstructured":"Zhang P, Du J, Wang L, Fei M, Yang T, Pardalos PM (2022) A human learning optimization algorithm with reasoning learning. Appl Soft Comput 122:108816","journal-title":"Appl Soft Comput"},{"key":"1157_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-020-09443-z","author":"Z Meng","year":"2012","unstructured":"Meng Z, Li G, Wang X, Sait S, Yildiz A (2012) A comparative study of metaheuristic algorithms for reliability-based design optimization problems. Arch Comput Methods Eng. https:\/\/doi.org\/10.1007\/s11831-020-09443-z","journal-title":"Arch Comput Methods Eng"},{"key":"1157_CR21","doi-asserted-by":"publisher","first-page":"115351","DOI":"10.1016\/j.eswa.2021.115351","volume":"183","author":"S Gupta","year":"2021","unstructured":"Gupta S, Abderazek H, Y\u0142ld\u0142z BS, Yildiz AR, Mirjalili S, Sait SM (2021) Comparison of metaheuristic optimization algorithms for solving constrained mechanical design optimization problems. Expert Syst Appl 183:115351","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1157_CR22","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1515\/mt-2020-0053","volume":"63","author":"BS Y\u0142ld\u0142z","year":"2021","unstructured":"Y\u0142ld\u0142z BS, Pholdee N, Bureerat S, Erda\u015f MU, Y\u0142ld\u0142z AR, Sait SM (2021) Comparision of the political optimization algorithm, the Archimedes optimization algorithm and the Levy flight algorithm for design optimization in industry. Mater Test 63(4):356\u2013359","journal-title":"Mater Test"},{"issue":"4","key":"1157_CR23","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1515\/mt-2020-0049","volume":"63","author":"BS Y\u0142ld\u0142z","year":"2021","unstructured":"Y\u0142ld\u0142z BS, Patel V, Pholdee N, Sait SM, Bureerat S, Y\u0142ld\u0142z AR (2021) Conceptual comparison of the ecogeography-based algorithm, equilibrium algorithm, marine predators algorithm and slime mold algorithm for optimal product design. Mater Test 63(4):336\u2013340","journal-title":"Mater Test"},{"issue":"5","key":"1157_CR24","doi-asserted-by":"publisher","first-page":"4031","DOI":"10.1007\/s11831-021-09531-8","volume":"28","author":"N Panagant","year":"2021","unstructured":"Panagant N, Pholdee N, Bureerat S, Yildiz AR, Mirjalili S (2021) A comparative study of recent multi-objective metaheuristics for solving constrained Truss optimisation problems. Arch Comput Methods Eng 28(5):4031\u20134047","journal-title":"Arch Comput Methods Eng"},{"issue":"10","key":"1157_CR25","doi-asserted-by":"publisher","first-page":"10275","DOI":"10.3934\/mbe.2022481","volume":"19","author":"J Zhang","year":"2022","unstructured":"Zhang J, Gao Z, Li S, Zhao J, Song W (2022) Improved intelligent clonal optimizer based on adaptive parameter strategy. Math Biosci Eng 19(10):10275\u201310315","journal-title":"Math Biosci Eng"},{"key":"1157_CR26","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, and Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, San Jose, California, USA [Online]. https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"key":"1157_CR27","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, and Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, Paris, France [Online]. https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"1157_CR28","doi-asserted-by":"publisher","first-page":"101828","DOI":"10.1016\/j.is.2021.101828","volume":"102","author":"S Zhang","year":"2021","unstructured":"Zhang S, Zeng X, Tang B (2021) RCELF: a residual-based approach for influence maximization problem. Inf Syst 102:101828. https:\/\/doi.org\/10.1016\/j.is.2021.101828","journal-title":"Inf Syst"},{"key":"1157_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","volume":"103","author":"L Cui","year":"2017","unstructured":"Cui L et al (2017) DDSE: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103:119\u2013130. https:\/\/doi.org\/10.1016\/j.jnca.2017.12.003","journal-title":"J Netw Comput Appl"},{"key":"1157_CR30","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Cong G, Wang Y, Si W, and Xie K (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the twenty-fifth AAAI conference on artificial intelligence, San Francisco, California","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"1157_CR31","doi-asserted-by":"publisher","first-page":"112971","DOI":"10.1016\/j.eswa.2019.112971","volume":"142","author":"A Zareie","year":"2020","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2020) Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl 142:112971. https:\/\/doi.org\/10.1016\/j.eswa.2019.112971","journal-title":"Expert Syst Appl"},{"key":"1157_CR32","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.eswa.2018.07.038","volume":"114","author":"A Simsek","year":"2018","unstructured":"Simsek A, Resul KARA (2018) Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks. Expert Syst Appl 114:224\u2013236. https:\/\/doi.org\/10.1016\/j.eswa.2018.07.038","journal-title":"Expert Syst Appl"},{"key":"1157_CR33","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-319-31204-0_25","volume-title":"Applications of evolutionary computation","author":"D Bucur","year":"2016","unstructured":"Bucur D, Iacca G (2016) Influence maximization in social networks with genetic algorithms. In: Squillero G, Burelli P (eds) Applications of evolutionary computation. Springer International Publishing, Cham, pp 379\u2013392"},{"key":"1157_CR34","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.future.2018.08.033","volume":"93","author":"C-W Tsai","year":"2019","unstructured":"Tsai C-W, Liu S-J (2019) SEIM: search economics for influence maximization in online social networks. Future Gener Comput Syst 93:1055\u20131064. https:\/\/doi.org\/10.1016\/j.future.2018.08.033","journal-title":"Future Gener Comput Syst"},{"key":"1157_CR35","doi-asserted-by":"publisher","first-page":"100167","DOI":"10.1016\/j.osnem.2021.100167","volume":"26","author":"R Cantini","year":"2021","unstructured":"Cantini R, Marozzo F, Mazza S, Talia D, Trunfio P (2021) A weighted artificial bee colony algorithm for influence maximization. Online Soc Netw Media 26:100167. https:\/\/doi.org\/10.1016\/j.osnem.2021.100167","journal-title":"Online Soc Netw Media"},{"key":"1157_CR36","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.physa.2017.02.067","volume":"478","author":"K Zhang","year":"2017","unstructured":"Zhang K, Du H, Feldman MW (2017) Maximizing influence in a social network: improved results using a genetic algorithm. Phys A Stat Mech Appl 478:20\u201330. https:\/\/doi.org\/10.1016\/j.physa.2017.02.067","journal-title":"Phys A Stat Mech Appl"},{"key":"1157_CR37","doi-asserted-by":"publisher","first-page":"126353","DOI":"10.1016\/j.physa.2021.126353","volume":"584","author":"Y Wang","year":"2021","unstructured":"Wang Y, Zhang Y, Yang F, Li D, Sun X, Ma J (2021) Time-sensitive positive influence maximization in signed social networks. Phys A Stat Mech Appl 584:126353. https:\/\/doi.org\/10.1016\/j.physa.2021.126353","journal-title":"Phys A Stat Mech Appl"},{"key":"1157_CR38","doi-asserted-by":"publisher","first-page":"126480","DOI":"10.1016\/j.physa.2021.126480","volume":"586","author":"J Jabari Lotf","year":"2022","unstructured":"Jabari Lotf J, Abdollahi Azgomi M, Dishabi MRE (2022) An improved influence maximization method for social networks based on genetic algorithm. Phys A Stat Mech Appl 586:126480. https:\/\/doi.org\/10.1016\/j.physa.2021.126480","journal-title":"Phys A Stat Mech Appl"},{"key":"1157_CR39","doi-asserted-by":"publisher","first-page":"102973","DOI":"10.1016\/j.jnca.2020.102973","volume":"178","author":"L Qiu","year":"2021","unstructured":"Qiu L, Tian X, Zhang J, Gu C, Sai S (2021) LIDDE: a differential evolution algorithm based on local-influence-descending search strategy for influence maximization in social networks. J Netw Comput Appl 178:102973. https:\/\/doi.org\/10.1016\/j.jnca.2020.102973","journal-title":"J Netw Comput Appl"},{"key":"1157_CR40","doi-asserted-by":"publisher","first-page":"114207","DOI":"10.1016\/j.eswa.2020.114207","volume":"169","author":"W Li","year":"2021","unstructured":"Li W, Zhong K, Wang J, Chen D (2021) A dynamic algorithm based on cohesive entropy for influence maximization in social networks. Expert Syst Appl 169:114207. https:\/\/doi.org\/10.1016\/j.eswa.2020.114207","journal-title":"Expert Syst Appl"},{"key":"1157_CR41","doi-asserted-by":"publisher","first-page":"107497","DOI":"10.1016\/j.knosys.2021.107497","volume":"233","author":"X Xie","year":"2021","unstructured":"Xie X, Li J, Sheng Y, Wang W, Yang W (2021) Competitive influence maximization considering inactive nodes and community homophily. Knowl-Based Syst 233:107497. https:\/\/doi.org\/10.1016\/j.knosys.2021.107497","journal-title":"Knowl-Based Syst"},{"key":"1157_CR42","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.ins.2021.04.061","volume":"568","author":"W Li","year":"2021","unstructured":"Li W, Li Z, Luvembe AM, Yang C (2021) Influence maximization algorithm based on Gaussian propagation model. Inf Sci 568:386\u2013402. https:\/\/doi.org\/10.1016\/j.ins.2021.04.061","journal-title":"Inf Sci"},{"key":"1157_CR43","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.future.2020.07.042","volume":"113","author":"MT Nguyen","year":"2020","unstructured":"Nguyen MT, Kim K (2020) Genetic convolutional neural network for intrusion detection systems. Future Gener Comput Syst 113:418\u2013427. https:\/\/doi.org\/10.1016\/j.future.2020.07.042","journal-title":"Future Gener Comput Syst"},{"key":"1157_CR44","doi-asserted-by":"publisher","first-page":"100107","DOI":"10.1016\/j.simpa.2021.100107","volume":"9","author":"G Iacca","year":"2021","unstructured":"Iacca G, Konotopska K, Bucur D, Tonda A (2021) An evolutionary framework for maximizing influence propagation in social networks. Softw Impacts 9:100107. https:\/\/doi.org\/10.1016\/j.simpa.2021.100107","journal-title":"Softw Impacts"},{"key":"1157_CR45","doi-asserted-by":"publisher","first-page":"105734","DOI":"10.1016\/j.asoc.2019.105734","volume":"85","author":"A Kumar","year":"2019","unstructured":"Kumar A, Misra RK, Singh D, Mishra S, Das S (2019) The spherical search algorithm for bound-constrained global optimization problems. Appl Soft Comput 85:105734. https:\/\/doi.org\/10.1016\/j.asoc.2019.105734","journal-title":"Appl Soft Comput"},{"key":"1157_CR46","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"key":"1157_CR47","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv Eng Softw"},{"key":"1157_CR48","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp Swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191. https:\/\/doi.org\/10.1016\/j.advengsoft.2017.07.002","journal-title":"Adv Eng Softw"},{"key":"1157_CR49","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl-Based Syst 89:228\u2013249. https:\/\/doi.org\/10.1016\/j.knosys.2015.07.006","journal-title":"Knowl-Based Syst"},{"issue":"13","key":"1157_CR50","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248. https:\/\/doi.org\/10.1016\/j.ins.2009.03.004","journal-title":"Inf Sci"},{"key":"1157_CR51","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.biosystems.2017.07.010","volume":"160","author":"F Fausto","year":"2017","unstructured":"Fausto F, Cuevas E, Valdivia A, Gonz\u00e1lez A (2017) A global optimization algorithm inspired in the behavior of selfish herds. Biosystems 160:39\u201355. https:\/\/doi.org\/10.1016\/j.biosystems.2017.07.010","journal-title":"Biosystems"},{"key":"1157_CR52","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.future.2019.07.015","volume":"101","author":"FA Hashim","year":"2019","unstructured":"Hashim FA, Houssein EH, Mabrouk MS, Al-Atabany W, Mirjalili S (2019) Henry gas solubility optimization: a novel physics-based algorithm. Future Gener Comput Syst 101:646\u2013667. https:\/\/doi.org\/10.1016\/j.future.2019.07.015","journal-title":"Future Gener Comput Syst"},{"key":"1157_CR53","volume-title":"Differential evolution, a practical approach to global optimization (natural computing series)","author":"K Price","year":"2005","unstructured":"Price K, Storn R, Lampinen JA (2005) Differential evolution, a practical approach to global optimization (natural computing series). Springer-Verlag, Berlin"},{"key":"1157_CR54","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks, 27 Nov\u20131 Dec 1995, vol 4, pp 1942\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1157_CR55","doi-asserted-by":"crossref","unstructured":"Elsayed S, Sarker R, and Essam D (2011) GA with a new multi-parent crossover for solving IEEE-CEC2011 competition problems, pp 1034\u20131040","DOI":"10.1109\/CEC.2011.5949708"},{"key":"1157_CR56","doi-asserted-by":"publisher","unstructured":"Tanabe R and Fukunaga AS (2014) Improving the search performance of SHADE using linear population size reduction. In: 2014 IEEE congress on evolutionary computation (CEC), 6-11 Jul 2014, pp 1658\u20131665. https:\/\/doi.org\/10.1109\/CEC.2014.6900380","DOI":"10.1109\/CEC.2014.6900380"},{"key":"1157_CR57","doi-asserted-by":"publisher","unstructured":"Awad NH, Ali MZ, and Suganthan PN (2017) Ensemble sinusoidal differential covariance matrix adaptation with Euclidean neighborhood for solving CEC2017 benchmark problems. In: 2017 IEEE congress on evolutionary computation (CEC), 5\u20138 Jun 2017, pp 372\u2013379. https:\/\/doi.org\/10.1109\/CEC.2017.7969336","DOI":"10.1109\/CEC.2017.7969336"},{"key":"1157_CR58","doi-asserted-by":"publisher","unstructured":"Mohamed AW, Hadi AA, Fattouh AM, and Jambi KM (2017) LSHADE with semi-parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark problems In: 2017 IEEE congress on evolutionary computation (CEC), 5-8 June 2017, pp. 145\u2013152. https:\/\/doi.org\/10.1109\/CEC.2017.7969307","DOI":"10.1109\/CEC.2017.7969307"},{"issue":"3","key":"1157_CR59","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104. https:\/\/doi.org\/10.1103\/PhysRevE.74.036104","journal-title":"Phys Rev E"},{"issue":"6","key":"1157_CR60","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 (2003) Self-similar community structure in a network of human interactions. Phys Rev E 68(6):065103. https:\/\/doi.org\/10.1103\/PhysRevE.68.065103","journal-title":"Phys Rev E"},{"issue":"1145\/1217299","key":"1157_CR61","doi-asserted-by":"publisher","first-page":"1217301","DOI":"10.1145\/1217299.1217301","volume":"10","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 10(1145\/1217299):1217301. https:\/\/doi.org\/10.1145\/1217299.1217301","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1157_CR62","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jnca.2016.10.020","volume":"86","author":"F Lu","year":"2017","unstructured":"Lu F, Zhang W, Shao L, Jiang X, Xu P, Jin H (2017) Scalable influence maximization under independent cascade model. J Netw Comput Appl 86:15\u201323. https:\/\/doi.org\/10.1016\/j.jnca.2016.10.020","journal-title":"J Netw Comput Appl"},{"key":"1157_CR63","first-page":"47","volume-title":"Finding overlapping communities using disjoint community detection algorithms","author":"S Gregory","year":"2009","unstructured":"Gregory S (2009) Finding overlapping communities using disjoint community detection algorithms. Springer, Berlin, pp 47\u201361"},{"key":"1157_CR64","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367\u2013368","author":"M Gong","year":"2016","unstructured":"Gong M, Yan J, Shen B, Ma L, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367\u2013368:600\u2013614. https:\/\/doi.org\/10.1016\/j.ins.2016.07.012","journal-title":"Inf Sci"},{"issue":"1","key":"1157_CR65","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Comput Netw ISDN Syst 30(1):107\u2013117. https:\/\/doi.org\/10.1016\/S0169-7552(98)00110-X","journal-title":"Comput Netw ISDN Syst"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01157-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-023-01157-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-023-01157-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T12:11:35Z","timestamp":1685535095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-023-01157-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,27]]},"references-count":65,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1157"],"URL":"https:\/\/doi.org\/10.1007\/s00607-023-01157-x","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,27]]},"assertion":[{"value":"6 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}