{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T18:21:09Z","timestamp":1778869269259,"version":"3.51.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,3,16]],"date-time":"2021-03-16T00:00:00Z","timestamp":1615852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,16]],"date-time":"2021-03-16T00:00:00Z","timestamp":1615852800000},"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":["Appl Intell"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10489-021-02283-9","type":"journal-article","created":{"date-parts":[[2021,3,16]],"date-time":"2021-03-16T08:03:35Z","timestamp":1615881815000},"page":"7749-7765","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization"],"prefix":"10.1007","volume":"51","author":[{"given":"Huan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6585-2656","authenticated-orcid":false,"given":"Ruisheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhili","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongna","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,16]]},"reference":[{"issue":"7415","key":"2283_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1038\/nature11421","volume":"489","author":"RM Bond","year":"2012","unstructured":"Bond RM, Fariss CJ, Jones JJ, Kramer ADI, Marlow C, Settle J E, Fowler JH (2012) A 61-million-person experiment in social influence and political mobilization. Nature 489(7415):295\u2013298. https:\/\/doi.org\/10.1038\/nature11421","journal-title":"Nature"},{"key":"2283_CR2","doi-asserted-by":"publisher","first-page":"13650","DOI":"10.1073\/pnas.1401211111","volume":"111","author":"NS Contractor","year":"2014","unstructured":"Contractor NS, DeChurch LA (2014) Integrating social networks and human social motives to achieve social influence at scale. Proc Natl Acad Sci 111:13650\u201313657. https:\/\/doi.org\/10.1073\/pnas.1401211111","journal-title":"Proc Natl Acad Sci"},{"key":"2283_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jnca.2018.01.005","volume":"106","author":"S Peng","year":"2018","unstructured":"Peng S, Zhou Y, Cao L, Yu S, Niu J, Jia W (2018) Influence analysis in social networks: A survey. J Netw Comput Appl 106:17\u201332. https:\/\/doi.org\/10.1016\/j.jnca.2018.01.005","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"2283_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.techfore.2011.06.003","volume":"79","author":"Y Cho","year":"2012","unstructured":"Cho Y, Hwang J, Lee D (2012) Identification of effective opinion leaders in the diffusion of technological innovation: A social network approach. Technol Forecast Soc Chang 79(1):97\u2013106. https:\/\/doi.org\/10.1016\/j.techfore.2011.06.003","journal-title":"Technol Forecast Soc Chang"},{"key":"2283_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.knosys.2013.01.005","volume":"43","author":"Y Li","year":"2013","unstructured":"Li Y, Ma S, Zhang Y, Huang R, Kinshuk (2013) An improved mix framework for opinion leader identification in online learning communities. Knowl-Based Syst 43:43\u201351. https:\/\/doi.org\/10.1016\/j.knosys.2013.01.005","journal-title":"Knowl-Based Syst"},{"key":"2283_CR6","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201901. Association for Computing Machinery, New York, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"2283_CR7","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (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, KDD\u201903. Association for Computing Machinery, New York, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"2283_CR8","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Vanbriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol 420-429, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"2283_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201909. Association for Computing Machinery, New York, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"2283_CR10","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) Staticgreedy: Solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, CIKM\u201913. Association for Computing Machinery, New York, pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"key":"2283_CR11","doi-asserted-by":"crossref","unstructured":"Jinha Kim HY (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks? In 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp 266\u2013277","DOI":"10.1109\/ICDE.2013.6544831"},{"key":"2283_CR12","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1016\/j.ins.2019.10.061","volume":"512","author":"W Ju","year":"2020","unstructured":"Ju W, Chen L, Li B, Liu W, Sheng J, Wang Y (2020) A new algorithm for positive influence maximization in signed networks. Inf Sci 512:1571\u20131591. https:\/\/doi.org\/10.1016\/j.ins.2019.10.061, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025519310163","journal-title":"Inf Sci"},{"issue":"5","key":"2283_CR13","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/TPDS.2014.2320515","volume":"26","author":"YW Guojie Song","year":"2015","unstructured":"Guojie Song YW, Xie K (2015) Influence maximization on large-scale mobile social network: A divide-and-conquer method. IEEE Trans Parallel Distrib Syst 26(5):1379\u20131392. https:\/\/doi.org\/10.1109\/TPDS.2014.2320515","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2283_CR14","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.physa.2018.08.045","volume":"512","author":"J Shang","year":"2018","unstructured":"Shang J, Wu H, Zhou S, Zhong J, Feng Y, Qiang B (2018) Impc: Influence maximization based on multi-neighbor potential in community networks. Physica A: Stat Mech Appl 512:1085\u20131103. https:\/\/doi.org\/10.1016\/j.physa.2018.08.045","journal-title":"Physica A: Stat Mech Appl"},{"issue":"6","key":"2283_CR15","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1007\/s10489-018-1387-8","volume":"49","author":"H Huang","year":"2019","unstructured":"Huang H, Shen H, Meng Z, Chang H, He H (2019) Community-based influence maximization for viral marketing. Appl Intell 49(6):2137\u20132150. https:\/\/doi.org\/10.1007\/s10489-018-1387-8","journal-title":"Appl Intell"},{"key":"2283_CR16","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201914. Society for Industrial and Applied Mathematics, USA, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"issue":"7","key":"2283_CR17","doi-asserted-by":"publisher","first-page":"2684","DOI":"10.1007\/s10489-018-01398-w","volume":"49","author":"X Rui","year":"2019","unstructured":"Rui X, Meng F, Wang Z, Yuan G (2019) A reversed node ranking approach for influence maximization in social networks. Appl Intell 49(7):2684\u20132698. https:\/\/doi.org\/10.1007\/s10489-018-01398-w","journal-title":"Appl Intell"},{"key":"2283_CR18","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31:581\u2013603. https:\/\/doi.org\/10.1007\/BF02289527","journal-title":"Psychometrika"},{"key":"2283_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L Freeman","year":"1977","unstructured":"Freeman L (1977) A set of measures of centrality based on betweenness. Sociometry 40:35\u201341. https:\/\/doi.org\/10.2307\/3033543","journal-title":"Sociometry"},{"issue":"3","key":"2283_CR20","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Soc Netw"},{"issue":"11","key":"2283_CR21","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.physleta.2017.01.043","volume":"381","author":"Z-K Bao","year":"2017","unstructured":"Bao Z-K, Liu J-G, Zhang H-F (2017) Identifying multiple influential spreaders by a heuristic clustering algorithm. Phys Lett A 381(11):976\u2013983. https:\/\/doi.org\/10.1016\/j.physleta.2017.01.043","journal-title":"Phys Lett A"},{"key":"2283_CR22","doi-asserted-by":"publisher","first-page":"120966","DOI":"10.1016\/j.physa.2019.04.202","volume":"526","author":"J Yuan","year":"2019","unstructured":"Yuan J, Zhang R, Tang J, Hu R, Wang Z, Li H (2019) Efficient and effective influence maximization in large-scale social networks via two frameworks. Physica A: Stat Mech Appl 526:120966. https:\/\/doi.org\/10.1016\/j.physa.2019.04.202","journal-title":"Physica A: Stat Mech Appl"},{"key":"2283_CR23","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ins.2020.03.060","volume":"527","author":"M Alshahrani","year":"2020","unstructured":"Alshahrani M, Fuxi Z, Sameh A, Mekouar S, Huang S (2020) Efficient algorithms based on centrality measures for identification of top-k influential users in social networks. Inf Sci 527:88\u2013107. https:\/\/doi.org\/10.1016\/j.ins.2020.03.060, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025520302395","journal-title":"Inf Sci"},{"key":"2283_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ins.2015.01.029","volume":"305","author":"T Xiong","year":"2015","unstructured":"Xiong T, Bao Y, Hu Z, Chiong R (2015) Forecasting interval time series using a fully complex-valued rbf neural network with dpso and pso algorithms. Inf Sci 305:77\u201392. https:\/\/doi.org\/10.1016\/j.ins.2015.01.029","journal-title":"Inf Sci"},{"key":"2283_CR25","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.asoc.2017.04.061","volume":"58","author":"J Wei","year":"2017","unstructured":"Wei J, Zhang R, Yu Z, Hu R, Tang J, Gui C, Yuan Y (2017) A bpso-svm algorithm based on memory renewal and enhanced mutation mechanisms for feature selection. Appl Soft Comput 58:176\u2013192. https:\/\/doi.org\/10.1016\/j.asoc.2017.04.061","journal-title":"Appl Soft Comput"},{"key":"2283_CR26","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan L VS (2011) Celf++: Optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, WWW\u201911. Association for Computing Machinery, New York, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"2283_CR27","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.physa.2014.10.088","volume":"420","author":"M Heidari","year":"2015","unstructured":"Heidari M, Asadpour M, Faili H (2015) Smg: Fast scalable greedy algorithm for influence maximization in social networks. Physica A: Stat Mech Appl 420:124\u2013133. https:\/\/doi.org\/10.1016\/j.physa.2014.10.088","journal-title":"Physica A: Stat Mech Appl"},{"issue":"C","key":"2283_CR28","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.knosys.2016.09.020","volume":"113","author":"W-X Lu","year":"2016","unstructured":"Lu W-X, Zhou C, Wu J (2016) Big social network influence maximization via recursively estimating influence spread. Know.-Based Syst. 113(C):143\u2013154. https:\/\/doi.org\/10.1016\/j.knosys.2016.09.020","journal-title":"Know.-Based Syst."},{"issue":"18","key":"2283_CR29","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin S, Page L (2012) Reprint of: The anatomy of a large-scale hypertextual web search engine. Comput Netw 56(18):3825\u20133833. https:\/\/doi.org\/10.1016\/j.comnet.2012.10.007. The WEB we live in","journal-title":"Comput Netw"},{"issue":"4","key":"2283_CR30","doi-asserted-by":"publisher","first-page":"48","DOI":"10.4018\/IJWSR.2015100104","volume":"12","author":"B Zhang","year":"2015","unstructured":"Zhang B, Wang Y, Jin Q, Ma J (2015) A pagerank-inspired heuristic scheme for influence maximization in social networks. Int. J. Web Serv. Res. 12(4):48\u201362. https:\/\/doi.org\/10.4018\/IJWSR.2015100104","journal-title":"Int. J. Web Serv. Res."},{"key":"2283_CR31","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.physa.2016.05.020","volume":"461","author":"X Wang","year":"2016","unstructured":"Wang X, Su Y, Zhao C, Yi D (2016) Effective identification of multiple influential spreaders by degreepunishment. Physica A: Stat Mech Appl 461:238\u2013247. https:\/\/doi.org\/10.1016\/j.physa.2016.05.020","journal-title":"Physica A: Stat Mech Appl"},{"key":"2283_CR32","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD\u201914. Association for Computing Machinery, New York, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"2283_CR33","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"2283_CR34","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD\u201916. Association for Computing Machinery, New York, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"key":"2283_CR35","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (2014) Sketch-based influence maximization and computation: Scaling up with guarantees. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, CIKM\u201914. Association for Computing Machinery, New York, pp 629\u2013638","DOI":"10.1145\/2661829.2662077"},{"issue":"2","key":"2283_CR36","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TKDE.2016.2624734","volume":"29","author":"X Wang","year":"2017","unstructured":"Wang X, Zhang Y, Zhang W, Lin X, Chen C (2017) Bring order into the samples: A novel scalable method for influence maximization. IEEE Trans Knowl Data Eng 29(2):243\u2013256. https:\/\/doi.org\/10.1109\/TKDE.2016.2624734","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2283_CR37","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ins.2017.02.023","volume":"394-395","author":"D Kim","year":"2017","unstructured":"Kim D, Hyeon D, Oh J, Han W-S, Yu H (2017) Influence maximization based on reachability sketches in dynamic graphs. Inf Sci 394-395:217\u2013231. https:\/\/doi.org\/10.1016\/j.ins.2017.02.023","journal-title":"Inf Sci"},{"key":"2283_CR38","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Cong G, Wang Y, Si W, Xie K (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI\u201911. AAAI Press, pp 127\u2013132","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"2283_CR39","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367-368","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-368:600\u2013614. https:\/\/doi.org\/10.1016\/j.ins.2016.07.012","journal-title":"Inf Sci"},{"issue":"3","key":"2283_CR40","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","volume":"11","author":"M Gong","year":"2016","unstructured":"Gong M, Song C, Duan C, Ma L, Shen B (2016) An efficient memetic algorithm for influence maximization in social networks. Comp Intell Mag 11(3):22\u201333. https:\/\/doi.org\/10.1109\/MCI.2016.2572538","journal-title":"Comp Intell Mag"},{"key":"2283_CR41","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","volume":"103","author":"L Cui","year":"2018","unstructured":"Cui L, Hu H, Yu S, Yan Q, Ming Z, Wen Z, Lu N (2018) 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":"2283_CR42","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":"2283_CR43","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","volume":"160","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang R, Yao Y, Zhao Z, Wang P, Li H, Yuan J (2018) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl-Based Syst 160:88\u2013103. https:\/\/doi.org\/10.1016\/j.knosys.2018.06.013, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0950705118303423","journal-title":"Knowl-Based Syst"},{"key":"2283_CR44","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201910. Association for Computing Machinery, New York , pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"2283_CR45","unstructured":"Christakis NA, Fowler JH (2009) Connected: The surprising power of our social networks and how they shape our lives. Little, Brown"},{"issue":"1","key":"2283_CR46","doi-asserted-by":"publisher","first-page":"5547","DOI":"10.1038\/srep05547","volume":"4","author":"S Pei","year":"2014","unstructured":"Pei S, Muchnik L, Andrade JJS, Zheng Z, Makse HA (2014) Searching for superspreaders of information in real-world social media. Sci Rep 4(1):5547. https:\/\/doi.org\/10.1038\/srep05547","journal-title":"Sci Rep"},{"key":"2283_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm. Comput Struct 169:1\u201312. https:\/\/doi.org\/10.1016\/j.compstruc.2016.03.001","journal-title":"Comput Struct"},{"key":"2283_CR48","doi-asserted-by":"crossref","unstructured":"Dos Santos Coelho L, Richter C, Mariani VC, Askarzadeh A (2016) Modified crow search approach applied to electromagnetic optimization. In: 2016 IEEE Conference on Electromagnetic Field Computation (CEFC), pp 1\u20131","DOI":"10.1109\/CEFC.2016.7815927"},{"key":"2283_CR49","doi-asserted-by":"publisher","unstructured":"Roy R, Sahu TP, Nagwani NK, Das S (2021) Global best guided crow search algorithm for optimization problems. In: Kumar R, Singh V P, Mathur A (eds) Intelligent Algorithms for Analysis and Control of Dynamical Systems. https:\/\/doi.org\/10.1007\/978-981-15-8045-1_2. Springer Singapore, Singapore, pp 13\u201322","DOI":"10.1007\/978-981-15-8045-1_2"},{"key":"2283_CR50","doi-asserted-by":"publisher","first-page":"106170","DOI":"10.1016\/j.asoc.2020.106170","volume":"90","author":"MS Turgut","year":"2020","unstructured":"Turgut M S, Turgut O E, Eliiyi D T (2020) Island-based crow search algorithm for solving optimal control problems. Appl Soft Comput 90:106170. https:\/\/doi.org\/10.1016\/j.asoc.2020.106170, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494620301101","journal-title":"Appl Soft Comput"},{"key":"2283_CR51","doi-asserted-by":"publisher","first-page":"102142","DOI":"10.1016\/j.jobe.2020.102142","volume":"38","author":"Y Ke","year":"2021","unstructured":"Ke Y, Xie J, Pouramini S (2021) Utilization of an improved crow search algorithm to solve building energy optimization problems: Cases of australia. J Build Eng 38:102142. https:\/\/doi.org\/10.1016\/j.jobe.2020.102142, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352710220337748","journal-title":"J Build Eng"},{"key":"2283_CR52","doi-asserted-by":"publisher","unstructured":"Cao L, Yue Y, Zhang Y, Cai Y (2021) Improved crow search algorithm optimized extreme learning machine based on classification algorithm and application. IEEE Access:1\u20131. https:\/\/doi.org\/10.1109\/ACCESS.2021.3054799","DOI":"10.1109\/ACCESS.2021.3054799"},{"key":"2283_CR53","doi-asserted-by":"publisher","first-page":"105784","DOI":"10.1016\/j.asoc.2019.105784","volume":"85","author":"R Dash","year":"2019","unstructured":"Dash R, Samal S, Dash R, Rautray R (2019) An integrated topsis crow search based classifier ensemble: In application to stock index price movement prediction. Appl Soft Comput 85:105784. https:\/\/doi.org\/10.1016\/j.asoc.2019.105784, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494619305654","journal-title":"Appl Soft Comput"},{"key":"2283_CR54","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.egyr.2021.01.006","volume":"7","author":"Q Huangpeng","year":"2021","unstructured":"Huangpeng Q, Huang W, Gholinia F (2021) Forecast of the hydropower generation under influence of climate change based on rcps and developed crow search optimization algorithm. Energy Rep 7:385\u2013397. https:\/\/doi.org\/10.1016\/j.egyr.2021.01.006, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S235248472100007X","journal-title":"Energy Rep"},{"key":"2283_CR55","doi-asserted-by":"crossref","unstructured":"De Souza RCT, d. S. Coelho L, De Macedo CA, Pierezan J (2018) A v-shaped binary crow search algorithm for feature selection. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp 1\u20138","DOI":"10.1109\/CEC.2018.8477975"},{"key":"2283_CR56","doi-asserted-by":"publisher","first-page":"189891","DOI":"10.1109\/ACCESS.2020.3031599","volume":"8","author":"M Ahmad","year":"2020","unstructured":"Ahmad M, Abdullah M, Moon H, Yoo S J, Han D (2020) Image classification based on automatic neural architecture search using binary crow search algorithm. IEEE Access 8:189891\u2013189912. https:\/\/doi.org\/10.1109\/ACCESS.2020.3031599","journal-title":"IEEE Access"},{"key":"2283_CR57","doi-asserted-by":"crossref","unstructured":"Bharanidharan N, Rajaguru H (2021) Classification of b-cell acute lymphoblastic leukemia microscopic images using crow search algorithm. In: Lim CT, Leo HL, Yeow R (eds) 17th International Conference on Biomedical Engineering. Springer International Publishing, Cham, pp 143\u2013154","DOI":"10.1007\/978-3-030-62045-5_14"},{"key":"2283_CR58","doi-asserted-by":"publisher","first-page":"173548","DOI":"10.1109\/ACCESS.2020.3024108","volume":"8","author":"AG Hussien","year":"2020","unstructured":"Hussien AG, Amin M, Wang M, Liang G, Alsanad A, Gumaei A, Chen H (2020) Crow search algorithm: Theory, recent advances, and applications. IEEE Access 8:173548\u2013173565. https:\/\/doi.org\/10.1109\/ACCESS.2020.3024108","journal-title":"IEEE Access"},{"key":"2283_CR59","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.eswa.2018.02.018","volume":"102","author":"M Allaoui","year":"2018","unstructured":"Allaoui M, Ahiod B, El Yafrani M (2018) A hybrid crow search algorithm for solving the dna fragment assembly problem. Expert Syst Appl 102:44\u201356. https:\/\/doi.org\/10.1016\/j.eswa.2018.02.018, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417418300976","journal-title":"Expert Syst Appl"},{"key":"2283_CR60","doi-asserted-by":"publisher","unstructured":"Haryono A, Sungkono, Agustin R, Santosa B J, Widodo A, Ramadhany B (2021) Correction to: Model parameter estimation and its uncertainty for 2-d inclined sheet structure in self-potential data using crow search algorithm. Acta Geodaetica et Geophysica. https:\/\/doi.org\/10.1007\/s40328-020-00330-4","DOI":"10.1007\/s40328-020-00330-4"},{"key":"2283_CR61","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.procs.2020.03.420","volume":"167","author":"S Laabadi","year":"2020","unstructured":"Laabadi S, Naimi M, Amri H E, Achchab B (2020) A binary crow search algorithm for solving two-dimensional bin packing problem with fixed orientation. Procedia Comput Sci 167:809\u2013818. https:\/\/doi.org\/10.1016\/j.procs.2020.03.420, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050920308863","journal-title":"Procedia Comput Sci"},{"key":"2283_CR62","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1038\/nphys1746","volume":"6","author":"M Kitsak","year":"2010","unstructured":"Kitsak M, Gallos L, Havlin S, Liljeros F, Muchnik L, Stanley H, Makse H (2010) Identification of influential spreaders in complex networks. Nat Phys 6:888\u2013893. https:\/\/doi.org\/10.1038\/nphys1746","journal-title":"Nat Phys"},{"key":"2283_CR63","doi-asserted-by":"publisher","first-page":"779","DOI":"10.2307\/3322456","volume":"36","author":"E Lazega","year":"1995","unstructured":"Lazega E, Burt R (1995) Structural holes: The social structure of competition. Rev Fran Sociol 36:779. https:\/\/doi.org\/10.2307\/3322456","journal-title":"Rev Fran Sociol"},{"key":"2283_CR64","doi-asserted-by":"publisher","first-page":"44221","DOI":"10.1109\/ACCESS.2018.2864240","volume":"6","author":"H Wu","year":"2018","unstructured":"Wu H, Shang J, Zhou S, Feng Y, Qiang B, Xie W (2018) Laim: A linear time iterative approach for efficient influence maximization in large-scale networks. IEEE Access 6:44221\u201344234","journal-title":"IEEE Access"},{"issue":"6","key":"2283_CR65","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2008","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2008) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the cec\u20192005 special session on real parameter optimization. J Heuristics 15(6):617. https:\/\/doi.org\/10.1007\/s10732-008-9080-4","journal-title":"J Heuristics"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02283-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02283-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02283-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T02:26:54Z","timestamp":1675045614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02283-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,16]]},"references-count":65,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2283"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02283-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,16]]},"assertion":[{"value":"18 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}