{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:29:02Z","timestamp":1775017742447,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:00:00Z","timestamp":1743811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T00:00:00Z","timestamp":1743811200000},"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":["J Supercomput"],"DOI":"10.1007\/s11227-025-07175-0","type":"journal-article","created":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T02:11:02Z","timestamp":1743905462000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["CLDE: a competitive learning-driven differential evolution optimization for the influence maximization problem in social networks"],"prefix":"10.1007","volume":"81","author":[{"given":"Baoqiang","family":"Chai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruisheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,5]]},"reference":[{"key":"7175_CR1","doi-asserted-by":"publisher","first-page":"103149","DOI":"10.1016\/j.jretconser.2022.103149","volume":"70","author":"S Barta","year":"2023","unstructured":"Barta S, Belanche D, Fern\u00e1ndez A, Flavi\u00e1n M (2023) Influencer marketing on tiktok: the effectiveness of humor and followers\u2019 hedonic experience. J Retail Consum Serv 70:103149. https:\/\/doi.org\/10.1016\/j.jretconser.2022.103149","journal-title":"J Retail Consum Serv"},{"key":"7175_CR2","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2020.07.028","volume":"414","author":"G Zhao","year":"2020","unstructured":"Zhao G, Jia P, Zhou A, Zhang B (2020) InfGCN: identifying influential nodes in complex networks with graph convolutional networks. Neurocomputing 414:18\u201326. https:\/\/doi.org\/10.1016\/j.neucom.2020.07.028","journal-title":"Neurocomputing"},{"key":"7175_CR3","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, 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, pp 137\u2013146. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"7175_CR4","doi-asserted-by":"publisher","first-page":"128719","DOI":"10.1016\/j.amc.2024.128719","volume":"475","author":"H Huang","year":"2024","unstructured":"Huang H, Pan J, Chen Y (2024) The competitive diffusion of knowledge and rumor in a multiplex network: a mathematical model. Appl Math Comput 475:128719. https:\/\/doi.org\/10.1016\/j.amc.2024.128719","journal-title":"Appl Math Comput"},{"key":"7175_CR5","doi-asserted-by":"publisher","first-page":"103357","DOI":"10.1016\/j.jnca.2022.103357","volume":"201","author":"G Liang","year":"2022","unstructured":"Liang G, Yao X, Gu Y, Huang H, Gu C (2022) Multi-batches revenue maximization for competitive products over online social network. J Netw Comput Appl 201:103357. https:\/\/doi.org\/10.1016\/j.jnca.2022.103357","journal-title":"J Netw Comput Appl"},{"key":"7175_CR6","doi-asserted-by":"publisher","first-page":"100393","DOI":"10.1016\/j.cosrev.2021.100393","volume":"40","author":"M Azaouzi","year":"2021","unstructured":"Azaouzi M, Mnasri W, Romdhane LB (2021) New trends in influence maximization models. Comput Sci Rev 40:100393. https:\/\/doi.org\/10.1016\/j.cosrev.2021.100393","journal-title":"Comput Sci Rev"},{"key":"7175_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2022.10.070","volume":"618","author":"Q Zhang","year":"2022","unstructured":"Zhang Q, Shuai B, L\u00fc M (2022) A novel method to identify influential nodes in complex networks based on gravity centrality. Inf Sci 618:98\u2013117. https:\/\/doi.org\/10.1016\/j.ins.2022.10.070","journal-title":"Inf Sci"},{"issue":"3","key":"7175_CR8","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/JETCAS.2023.3283680","volume":"13","author":"D Chen","year":"2023","unstructured":"Chen D, Su H (2023) Identification of influential nodes in complex networks with degree and average neighbor degree. IEEE J Emerg Sel Topics Circuits Syst 13(3):734\u2013742. https:\/\/doi.org\/10.1109\/JETCAS.2023.3283680","journal-title":"IEEE J Emerg Sel Topics Circuits Syst"},{"key":"7175_CR9","doi-asserted-by":"publisher","first-page":"2437","DOI":"10.1007\/s00607-021-00945-7","volume":"103","author":"Z Aghaee","year":"2021","unstructured":"Aghaee Z, Ghasemi MM, Beni HA, Bouyer A, Fatemi A (2021) A survey on meta-heuristic algorithms for the influence maximization problem in the social networks. Computing 103:2437\u20132477. https:\/\/doi.org\/10.1007\/s00607-021-00945-7","journal-title":"Computing"},{"issue":"6","key":"7175_CR10","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1109\/TEVC.2021.3081478","volume":"25","author":"L Wang","year":"2021","unstructured":"Wang L, Ma L, Wang C, Xie N-G, Koh JM, Cheong KH (2021) Identifying influential spreaders in social networks through discrete moth-flame optimization. IEEE Trans Evol Comput 25(6):1091\u20131102. https:\/\/doi.org\/10.1109\/TEVC.2021.3081478","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"7175_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.3390\/sym15010117","volume":"15","author":"J Tang","year":"2022","unstructured":"Tang J, Zhu H, Lan J, Zhang L, Song S (2022) Maximizing the influence spread in social networks: a learning-automata-driven discrete butterfly optimization algorithm. Symmetry 15(1):117. https:\/\/doi.org\/10.3390\/sym15010117","journal-title":"Symmetry"},{"issue":"2","key":"7175_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2024.04.004","volume":"321","author":"R Mart\u00ed","year":"2025","unstructured":"Mart\u00ed R, Sevaux M, S\u00f6rensen K (2025) Fifty years of metaheuristics. Eur J Oper Res 321(2):345\u2013362. https:\/\/doi.org\/10.1016\/j.ejor.2024.04.004","journal-title":"Eur J Oper Res"},{"key":"7175_CR13","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"},{"issue":"9","key":"7175_CR14","doi-asserted-by":"publisher","first-page":"7570","DOI":"10.1016\/j.jksuci.2021.08.009","volume":"34","author":"SS Singh","year":"2022","unstructured":"Singh SS, Srivastva D, Verma M, Singh J (2022) Influence maximization frameworks, performance, challenges and directions on social network: a theoretical study. J King Saud Univ Comput Inf Sci 34(9):7570\u20137603. https:\/\/doi.org\/10.1016\/j.jksuci.2021.08.009","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"7175_CR15","doi-asserted-by":"publisher","first-page":"123429","DOI":"10.1016\/j.eswa.2024.123429","volume":"248","author":"M Jaouadi","year":"2024","unstructured":"Jaouadi M, Romdhane LB (2024) A survey on influence maximization models. Expert Syst Appl 248:123429. https:\/\/doi.org\/10.1016\/j.eswa.2024.123429","journal-title":"Expert Syst Appl"},{"key":"7175_CR16","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 420\u2013429. https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"issue":"4","key":"7175_CR17","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1109\/TKDE.2020.3003047","volume":"34","author":"T Cai","year":"2022","unstructured":"Cai T, Li J, Mian A, Li R-H, Sellis T, Yu JX (2022) Target-aware holistic influence maximization in spatial social networks. IEEE Trans Knowl Data Eng 34(4):1993\u20132007. https:\/\/doi.org\/10.1109\/TKDE.2020.3003047","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"7175_CR18","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/TKDE.2019.2930690","volume":"33","author":"D Li","year":"2019","unstructured":"Li D, Liu J (2019) Modeling influence diffusion over signed social networks. IEEE Trans Knowl Data Eng 33(2):613\u2013625. https:\/\/doi.org\/10.1109\/TKDE.2019.2930690","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"7175_CR19","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1109\/TKDE.2021.3093934","volume":"35","author":"Y Zhu","year":"2023","unstructured":"Zhu Y, Tang J, Tang X, Wang S, Lim A (2023) 2-hop+ sampling: efficient and effective influence estimation. IEEE Trans Knowl Data Eng 35(2):1088\u20131103. https:\/\/doi.org\/10.1109\/TKDE.2021.3093934","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"7175_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-024-10725-2","volume":"57","author":"Y Xiao","year":"2024","unstructured":"Xiao Y, Chen Y, Zhang H, Zhu X, Yang Y, Zhu X (2024) A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood. Artif Intell Rev 57(5):1\u201321. https:\/\/doi.org\/10.1007\/s10462-024-10725-2","journal-title":"Artif Intell Rev"},{"key":"7175_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2023.102945d","volume":"122","author":"T Wen","year":"2024","unstructured":"Wen T, Chen Y-w, Syed T, Wu T (2024) ERIUE: evidential reasoning-based influential users evaluation in social networks. Omega 122:102945. https:\/\/doi.org\/10.1016\/j.omega.2023.102945d","journal-title":"Omega"},{"key":"7175_CR22","doi-asserted-by":"publisher","first-page":"126936","DOI":"10.1016\/j.neucom.2023.126936","volume":"564","author":"C Guo","year":"2024","unstructured":"Guo C, Li W, Liu F, Zhong K, Wu X, Zhao Y, Jin Q (2024) Influence maximization algorithm based on group trust and local topology structure. Neurocomputing 564:126936. https:\/\/doi.org\/10.1016\/j.neucom.2023.126936","journal-title":"Neurocomputing"},{"key":"7175_CR23","doi-asserted-by":"publisher","unstructured":"Ling C, Jiang J, Wang J, Thai MT, Xue R, Song J, Qiu M, Zhao L (2023) Deep graph representation learning and optimization for influence maximization. In: International Conference on Machine Learning, pp 21350\u201321361. https:\/\/doi.org\/10.5555\/3618408.3619288","DOI":"10.5555\/3618408.3619288"},{"key":"7175_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2024.102183","volume":"36","author":"J Tang","year":"2024","unstructured":"Tang J, Qu J, Song S, Zhao Z, Du Q (2024) GCNT: identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers. J King Saud Univ Comput Inf Sci 36:102183. https:\/\/doi.org\/10.1016\/j.jksuci.2024.102183","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"7175_CR25","doi-asserted-by":"publisher","first-page":"119086","DOI":"10.1016\/j.eswa.2022.119086","volume":"214","author":"AA Rezaei","year":"2023","unstructured":"Rezaei AA, Munoz J, Jalili M, Khayyam H (2023) A machine learning-based approach for vital node identification in complex networks. Expert Syst Appl 214:119086. https:\/\/doi.org\/10.1016\/j.eswa.2022.119086","journal-title":"Expert Syst Appl"},{"issue":"5","key":"7175_CR26","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.26599\/TST.2023.9010140","volume":"29","author":"L Gui","year":"2024","unstructured":"Gui L, Li X, Zhang Q, Gao L (2024) Domain knowledge used in meta-heuristic algorithms for the job-shop scheduling problem: review and analysis. Tsinghua Sci Technol 29(5):1368\u20131389. https:\/\/doi.org\/10.26599\/TST.2023.9010140","journal-title":"Tsinghua Sci Technol"},{"issue":"4","key":"7175_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/MCI.2024.3440213","volume":"19","author":"H Tong","year":"2024","unstructured":"Tong H, Minku LL, Menzel S, Sendhoff B, Yao X (2024) Evaluating meta-heuristic algorithms for dynamic capacitated arc routing problems based on a novel lower bound method. IEEE Comput Intell Mag 19(4):31\u201344. https:\/\/doi.org\/10.1109\/MCI.2024.3440213","journal-title":"IEEE Comput Intell Mag"},{"key":"7175_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109675","volume":"185","author":"N Srinath","year":"2023","unstructured":"Srinath N, Yilmazlar IO, Kurz ME, Taaffe K (2023) Hybrid multi-objective evolutionary meta-heuristics for a parallel machine scheduling problem with setup times and preferences. Comput Ind Eng 185:109675. https:\/\/doi.org\/10.1016\/j.cie.2023.109675","journal-title":"Comput Ind Eng"},{"issue":"3","key":"7175_CR29","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1007\/s12597-023-00662-z","volume":"60","author":"F Riquelme","year":"2023","unstructured":"Riquelme F, Mu\u00f1oz F, Olivares R (2023) A depth-based heuristic to solve the multi-objective influence spread problem using particle swarm optimization. Opsearch 60(3):1267\u20131285. https:\/\/doi.org\/10.1007\/s12597-023-00662-z","journal-title":"Opsearch"},{"key":"7175_CR30","doi-asserted-by":"publisher","unstructured":"Jiang Q, Song G, Gao C, Wang Y, Si W, Xie K (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol 25, pp 127\u2013132. https:\/\/doi.org\/10.1609\/aaai.v25i1.7838","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"7175_CR31","doi-asserted-by":"publisher","unstructured":"Chawla A, Cheney N (2023) Neighbor-hop mutation for genetic algorithm in influence maximization. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, pp 187\u2013190. https:\/\/doi.org\/10.1145\/3583133.3590755","DOI":"10.1145\/3583133.3590755"},{"key":"7175_CR32","doi-asserted-by":"publisher","unstructured":"Cunegatti E, Custode L, Iacca G (2024) Many-objective evolutionary influence maximization: Balancing spread, budget, fairness, and time. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp 655\u2013658 . https:\/\/doi.org\/10.1145\/3638530.3654161","DOI":"10.1145\/3638530.3654161"},{"key":"7175_CR33","doi-asserted-by":"publisher","unstructured":"Konotopska K, Iacca G (2021) Graph-aware evolutionary algorithms for influence maximization. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp 1467\u20131475. https:\/\/doi.org\/10.1145\/3449726.3463138","DOI":"10.1145\/3449726.3463138"},{"key":"7175_CR34","doi-asserted-by":"publisher","first-page":"105554","DOI":"10.1016\/j.asoc.2019.105554","volume":"82","author":"SS Singh","year":"2019","unstructured":"Singh SS, Kumar A, Singh K, Biswas B (2019) LAPSO-IM: a learning-based influence maximization approach for social networks. Appl Soft Comput 82:105554. https:\/\/doi.org\/10.1016\/j.asoc.2019.105554","journal-title":"Appl Soft Comput"},{"key":"7175_CR35","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367","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:600\u2013614. https:\/\/doi.org\/10.1016\/j.ins.2016.07.012","journal-title":"Inf Sci"},{"issue":"21","key":"7175_CR36","doi-asserted-by":"publisher","first-page":"25070","DOI":"10.1007\/s10489-023-04884-y","volume":"53","author":"J Tang","year":"2023","unstructured":"Tang J, Song S, Lan J, Zhang L, Zhao F (2023) Steering the spread of influence adaptively in social networks via a discrete scheduled particle swarm optimization. Appl Intell 53(21):25070\u201325091. https:\/\/doi.org\/10.1007\/s10489-023-04884-y","journal-title":"Appl Intell"},{"key":"7175_CR37","doi-asserted-by":"publisher","first-page":"111037","DOI":"10.1016\/j.asoc.2023.111037","volume":"149","author":"I Khatri","year":"2023","unstructured":"Khatri I, Choudhry A, Rao A, Tyagi A, Vishwakarma DK, Prasad M (2023) Influence maximization in social networks using discretized Harris\u2019 Hawks optimization algorithm. Appl Soft Comput 149:111037. https:\/\/doi.org\/10.1016\/j.asoc.2023.111037","journal-title":"Appl Soft Comput"},{"key":"7175_CR38","doi-asserted-by":"publisher","first-page":"102466","DOI":"10.1016\/j.is.2024.102466","volume":"127","author":"S Wang","year":"2025","unstructured":"Wang S, Liu W, Chen L, Zong S (2025) Influence maximization based on discrete particle swarm optimization on multilayer network. Inf Syst 127:102466. https:\/\/doi.org\/10.1016\/j.is.2024.102466","journal-title":"Inf Syst"},{"issue":"6","key":"7175_CR39","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1109\/TEVC.2023.3325004","volume":"28","author":"P Jiang","year":"2023","unstructured":"Jiang P, Liu J, Cheng Y (2023) Bi-population enhanced cooperative differential evolution for constrained large-scale optimization problems. IEEE Trans Evol Comput 28(6):1620\u20131632. https:\/\/doi.org\/10.1109\/TEVC.2023.3325004","journal-title":"IEEE Trans Evol Comput"},{"key":"7175_CR40","doi-asserted-by":"publisher","first-page":"101466","DOI":"10.1016\/j.swevo.2023.101466","volume":"85","author":"J Liu","year":"2024","unstructured":"Liu J, Sarker R, Elsayed S, Essam D, Siswanto N (2024) Large-scale evolutionary optimization: a review and comparative study. Swarm Evol Comput 85:101466. https:\/\/doi.org\/10.1016\/j.swevo.2023.101466","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"7175_CR41","doi-asserted-by":"publisher","first-page":"29006","DOI":"10.1038\/s41598-024-76877-x","volume":"14","author":"V Palakonda","year":"2024","unstructured":"Palakonda V, Ghorbanpour S, Kang J-M, Jung H (2024) External archive guided radial-grid multi objective differential evolution. Sci Rep 14(1):29006. https:\/\/doi.org\/10.1038\/s41598-024-76877-x","journal-title":"Sci Rep"},{"key":"7175_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107817","volume":"131","author":"X Yu","year":"2024","unstructured":"Yu X, Xu P, Wang F, Wang X (2024) Reinforcement learning-based differential evolution algorithm for constrained multi-objective optimization problems. Eng Appl Artif Intell 131:107817. https:\/\/doi.org\/10.1016\/j.engappai.2023.107817","journal-title":"Eng Appl Artif Intell"},{"key":"7175_CR43","doi-asserted-by":"publisher","first-page":"116342","DOI":"10.1016\/j.eswa.2021.116342","volume":"192","author":"TK Biswas","year":"2022","unstructured":"Biswas TK, Abbasi A, Chakrabortty RK (2022) A two-stage VIKOR assisted multi-operator differential evolution approach for influence maximization in social networks. Expert Syst Appl 192:116342. https:\/\/doi.org\/10.1016\/j.eswa.2021.116342","journal-title":"Expert Syst Appl"},{"key":"7175_CR44","doi-asserted-by":"publisher","first-page":"127195","DOI":"10.1016\/j.neucom.2023.127195","volume":"572","author":"E Zhu","year":"2024","unstructured":"Zhu E, Wang H, Zhang Y, Zhang K, Liu C (2024) PHEE: identifying influential nodes in social networks with a phased evaluation-enhanced search. Neurocomputing 572:127195. https:\/\/doi.org\/10.1016\/j.neucom.2023.127195","journal-title":"Neurocomputing"},{"key":"7175_CR45","doi-asserted-by":"publisher","unstructured":"Cunegatti E, Iacca G, Bucur D (2022) Large-scale multi-objective influence maximisation with network downscaling. In: International Conference on Parallel Problem Solving from Nature. Springer, pp 207\u2013220. https:\/\/doi.org\/10.1007\/978-3-031-14721-0_15","DOI":"10.1007\/978-3-031-14721-0_15"},{"issue":"2","key":"7175_CR46","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCYB.2014.2322602","volume":"45","author":"R Cheng","year":"2014","unstructured":"Cheng R, Jin Y (2014) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45(2):191\u2013204. https:\/\/doi.org\/10.1109\/TCYB.2014.2322602","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"7175_CR47","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s40747-022-00808-4","volume":"9","author":"J Du","year":"2023","unstructured":"Du J, Wang L, Fei M, Menhas MI (2023) A human learning optimization algorithm with competitive and cooperative learning. Complex Intell Syst 9(1):797\u2013823. https:\/\/doi.org\/10.1007\/s40747-022-00808-4","journal-title":"Complex Intell Syst"},{"issue":"3","key":"7175_CR48","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/physreve.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman ME (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"},{"key":"7175_CR49","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1016\/j.ins.2022.07.172","volume":"610","author":"S Zhong","year":"2022","unstructured":"Zhong S, Zhang H, Deng Y (2022) Identification of influential nodes in complex networks: a local degree dimension approach. Inf Sci 610:994\u20131009. https:\/\/doi.org\/10.1016\/j.ins.2022.07.172","journal-title":"Inf Sci"},{"key":"7175_CR50","doi-asserted-by":"publisher","first-page":"104833","DOI":"10.1016\/j.knosys.2019.07.004","volume":"187","author":"J Tang","year":"2020","unstructured":"Tang J, Zhang R, Wang P, Zhao Z, Fan L, Liu X (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl-Based Syst 187:104833. https:\/\/doi.org\/10.1016\/j.knosys.2019.07.004","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"7175_CR51","doi-asserted-by":"publisher","first-page":"103681","DOI":"10.1016\/j.ipm.2024.103681","volume":"61","author":"Y Li","year":"2024","unstructured":"Li Y, Lu T, Li W, Zhang P (2024) HCCKshell: a heterogeneous cross-comparison improved Kshell algorithm for influence maximization. Inf Process Manage 61(3):103681. https:\/\/doi.org\/10.1016\/j.ipm.2024.103681","journal-title":"Inf Process Manage"},{"key":"7175_CR52","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.future.2022.08.005","volume":"138","author":"JE Soto","year":"2023","unstructured":"Soto JE, Hern\u00e1ndez C, Figueroa M (2023) JACC-FPGA: a hardware accelerator for Jaccard similarity estimation using FPGAs in the cloud. Future Gener Comput Syst 138:26\u201342. https:\/\/doi.org\/10.1016\/j.future.2022.08.005","journal-title":"Future Gener Comput Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07175-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07175-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07175-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T02:11:03Z","timestamp":1743905463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07175-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,5]]},"references-count":52,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["7175"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07175-0","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,5]]},"assertion":[{"value":"9 March 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2025","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}],"article-number":"700"}}