{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T22:25:49Z","timestamp":1770330349906,"version":"3.49.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"content-version":"vor","delay-in-days":38,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/100017367","name":"Research Fund for Young Star of Science and Technology in Shaanxi Province","doi-asserted-by":"publisher","award":["2025ZC-KJXX-09"],"award-info":[{"award-number":["2025ZC-KJXX-09"]}],"id":[{"id":"10.13039\/100017367","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s44443-025-00403-w","type":"journal-article","created":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T09:18:59Z","timestamp":1764926339000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Influence maximization in social networks using discrete spider monkey optimization"],"prefix":"10.1007","volume":"38","author":[{"given":"Qing","family":"Liu","sequence":"first","affiliation":[]},{"given":"Wenjing","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"403_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"M Akhand","year":"2020","unstructured":"Akhand M, Ayon SI, Shahriyar S, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput 86:105887","journal-title":"Appl Soft Comput"},{"issue":"1\u20137","key":"403_CR2","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\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"403_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120600","volume":"229","author":"Y Chen","year":"2023","unstructured":"Chen Y, Zhong J, Mumtaz J, Zhou S, Zhu L (2023) An improved spider monkey optimization algorithm for multi-objective planning and scheduling problems of PCB assembly line. Expert Syst Appl 229:120600","journal-title":"Expert Syst Appl"},{"key":"403_CR4","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Chen W, Cheng X (2014) Imrank: influence maximization via finding self-consistent ranking. In: Proceedings of the 37th international ACM SIGIR conference on research & development in information retrieval, pp 475\u2013484","DOI":"10.1145\/2600428.2609592"},{"key":"403_CR5","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010a) 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, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"403_CR6","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, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"403_CR7","doi-asserted-by":"crossref","unstructured":"Chen W, Yuan Y, Zhang L (2010b) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE international conference on data mining. IEEE, pp 88\u201397","DOI":"10.1109\/ICDM.2010.118"},{"key":"403_CR8","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, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"403_CR9","unstructured":"Dong C, Xu GQ, Meng L (2024) CRB: a new rumor blocking algorithm in online social networks based on competitive spreading model and influence maximization. Chinese Phys B"},{"key":"403_CR10","doi-asserted-by":"crossref","unstructured":"Fink CG, Fullin K, Gutierrez G, Omodt N, Zinnecker S, Sprint G et\u00a0al (2023) A centrality measure for quantifying spread on weighted, directed networks. Physica A","DOI":"10.2139\/ssrn.4415860"},{"key":"403_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) 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:617\u2013644","journal-title":"J Heuristics"},{"key":"403_CR12","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","journal-title":"Inf Sci"},{"key":"403_CR13","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++ optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"issue":"8","key":"403_CR14","doi-asserted-by":"publisher","first-page":"e0329350","DOI":"10.1371\/journal.pone.0329350","volume":"20","author":"L Han","year":"2025","unstructured":"Han L, Yang K, Ming Y, Tang J (2025) PDCSA: a parallel discrete crow search algorithm for influence maximization in social networks. PLoS ONE 20(8):e0329350","journal-title":"PLoS ONE"},{"key":"403_CR15","doi-asserted-by":"crossref","unstructured":"He Q, Yan X, Jolfaei A, Tolba A, Yu K, Fu YK et\u00a0al (2025) Influence maximization in sentiment propagation with multisearch particle swarm optimization algorithm. IEEE Trans Comput Soc Syst","DOI":"10.1109\/TCSS.2025.3528890"},{"key":"403_CR16","doi-asserted-by":"publisher","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","journal-title":"Expert Syst Appl"},{"key":"403_CR17","doi-asserted-by":"crossref","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\u00a025, pp 127\u2013132","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"403_CR18","doi-asserted-by":"crossref","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","DOI":"10.1145\/956750.956769"},{"key":"403_CR19","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","journal-title":"Appl Soft Comput"},{"issue":"4","key":"403_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3690644","volume":"18","author":"S Kumar Meena","year":"2024","unstructured":"Kumar Meena S, Sheshar Singh S, Singh K (2024) Cuckoo search optimization-based influence maximization in dynamic social networks. ACM Trans Web 18(4):1\u201325","journal-title":"ACM Trans Web"},{"issue":"2","key":"403_CR21","doi-asserted-by":"publisher","first-page":"e7469","DOI":"10.1002\/cpe.7469","volume":"35","author":"M Kumar","year":"2023","unstructured":"Kumar M, Dubey K, Singh S, Kumar Samriya J, Gill SS (2023) Experimental performance analysis of cloud resource allocation framework using spider monkey optimization algorithm. Concurr Comput Pract Exp 35(2):e7469","journal-title":"Concurr Comput Pract Exp"},{"issue":"1","key":"403_CR22","doi-asserted-by":"publisher","first-page":"17196","DOI":"10.1038\/s41598-024-68342-6","volume":"14","author":"D Kumari","year":"2024","unstructured":"Kumari D, Sinha A, Dutta S, Pranav P (2024) Optimizing neural networks using spider monkey optimization algorithm for intrusion detection system. Sci Rep 14(1):17196","journal-title":"Sci Rep"},{"key":"403_CR23","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the SIGCHI conference on human factors in computing systems, pp 1361\u20131370","DOI":"10.1145\/1753326.1753532"},{"key":"403_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007a) Graph evolution: Densification and shrinking diameters. ACM Trans Knowl Disc Data (TKDD) 1(1):2\u2013es","DOI":"10.1145\/1217299.1217301"},{"key":"403_CR25","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007b) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"403_CR26","unstructured":"Leskovec J, Mcauley J (2012) Learning to discover social circles in ego networks. Adv Neural Inf Process Syst 25"},{"key":"403_CR27","volume":"442","author":"Q Li","year":"2023","unstructured":"Li Q, Cheng L, Wang W, Li X, Li S, Zhu P (2023) Influence maximization through exploring structural information. Appl Math Comput 442:127721","journal-title":"Appl Math Comput"},{"key":"403_CR28","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ins.2022.11.041","volume":"619","author":"Z Liang","year":"2023","unstructured":"Liang Z, He Q, Du H, Xu W (2023) Targeted influence maximization in competitive social networks. Inf Sci 619:390\u2013405","journal-title":"Inf Sci"},{"issue":"1","key":"403_CR29","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1007\/s40747-023-01220-2","volume":"10","author":"JC Liang","year":"2024","unstructured":"Liang JC, Gong YJ, Wu XK, Li Y (2024) Customized influence maximization in attributed social networks: heuristic and meta-heuristic algorithms. Complex Intell Syst 10(1):1409\u20131424","journal-title":"Complex Intell Syst"},{"key":"403_CR30","doi-asserted-by":"crossref","unstructured":"Liu W, Deng Z, Chen Y, Chen L (2025) A greedy descent method for budget constrained continuous influence maximization in online social network. IEEE Trans Comput Soc Syst","DOI":"10.1109\/TCSS.2025.3551651"},{"issue":"3","key":"403_CR31","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1007\/s12652-023-04680-z","volume":"15","author":"I Lozano-Osorio","year":"2024","unstructured":"Lozano-Osorio I, S\u00e1nchez-Oro J, Duarte A (2024) An efficient and effective GRASP algorithm for the budget influence maximization problem. J Ambient Intell Humaniz Comput 15(3):2023\u20132034","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"7","key":"403_CR32","doi-asserted-by":"publisher","first-page":"pgae236","DOI":"10.1093\/pnasnexus\/pgae236","volume":"3","author":"CW Lynn","year":"2024","unstructured":"Lynn CW, Holmes CM, Palmer SE (2024) Emergent scale-free networks. PNAS Nexus 3(7):pgae236","journal-title":"PNAS Nexus"},{"key":"403_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105606","volume":"83","author":"L Ma","year":"2019","unstructured":"Ma L, Liu Y (2019) Maximizing three-hop influence spread in social networks using discrete comprehensive learning artificial bee colony optimizer. Appl Soft Comput 83:105606","journal-title":"Appl Soft Comput"},{"key":"403_CR34","doi-asserted-by":"crossref","unstructured":"Ondiek JO, Onyango G (2023) Strengthening citizen agencies in policymaking through social media. In: Public policy and technological transformations in Africa: nurturing policy entrepreneurship, policy tools and citizen participation. Springer, pp 257\u2013278","DOI":"10.1007\/978-3-031-18704-9_11"},{"key":"403_CR35","doi-asserted-by":"crossref","unstructured":"Rostamnia M, Kianian S (2019) Vertex cover preprocessing for influence maximization algorithms. In: 2019 5th conference on Knowledge Based Engineering and Innovation (KBEI). IEEE, pp 338\u2013342","DOI":"10.1109\/KBEI.2019.8734949"},{"key":"403_CR36","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Sarkar R (2020a) Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM international conference on information & knowledge management, pp 1325\u20131334","DOI":"10.1145\/3340531.3411866"},{"key":"403_CR37","doi-asserted-by":"crossref","unstructured":"Rozemberczki B, Sarkar R (2020b) Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM international conference on information and knowledge management (CIKM \u201920). ACM, pp 1325\u20131334","DOI":"10.1145\/3340531.3411866"},{"key":"403_CR38","unstructured":"Scott J (2002) Social networks: critical concepts in sociology, vol\u00a04. Taylor & Francis"},{"key":"403_CR39","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","journal-title":"Physica A: Stat Mech Appl"},{"key":"403_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106436","volume":"94","author":"A Sheikhahmadi","year":"2020","unstructured":"Sheikhahmadi A, Zareie A (2020) Identifying influential spreaders using multi-objective artificial bee colony optimization. Appl Soft Comput 94:106436","journal-title":"Appl Soft Comput"},{"issue":"13","key":"403_CR41","doi-asserted-by":"publisher","first-page":"10181","DOI":"10.1007\/s00500-019-04533-y","volume":"24","author":"SS Singh","year":"2020","unstructured":"Singh SS, Singh K, Kumar A, Biswas B (2020) ACO-IM: maximizing influence in social networks using ant colony optimization. Soft Comput 24(13):10181\u201310203","journal-title":"Soft Comput"},{"issue":"5","key":"403_CR42","doi-asserted-by":"publisher","DOI":"10.1088\/1674-1056\/ad20d6","volume":"33","author":"Z Su","year":"2024","unstructured":"Su Z, Chen L, Ai J, Zheng YY, Bie N (2024) Identifying influential spreaders in complex networks based on density entropy and community structure. Chin Phys B 33(5):058901","journal-title":"Chin Phys B"},{"key":"403_CR43","doi-asserted-by":"publisher","first-page":"107809","DOI":"10.1109\/ACCESS.2022.3213044","volume":"10","author":"K Taha","year":"2022","unstructured":"Taha K (2022) Identifying the top-k influential spreaders in social networks: a survey and experimental evaluation. IEEE Access 10:107809\u2013107845","journal-title":"IEEE Access"},{"key":"403_CR44","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 et al (2018) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl-Based Syst 160:88\u2013103","journal-title":"Knowl-Based Syst"},{"key":"403_CR45","doi-asserted-by":"publisher","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","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"403_CR46","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, Ng Xie, Koh JM, Cheong KH (2021) Identifying influential spreaders in social networks through discrete moth-flame optimization. IEEE Trans Evol Comput 25(6):1091\u20131102","journal-title":"IEEE Trans Evol Comput"},{"key":"403_CR47","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","journal-title":"Comput Netw"},{"issue":"1","key":"403_CR48","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s41109-024-00625-3","volume":"9","author":"E Yanchenko","year":"2024","unstructured":"Yanchenko E, Murata T, Holme P (2024) Influence maximization on temporal networks: a review. Appl Netw Sci 9(1):16","journal-title":"Appl Netw Sci"},{"issue":"1","key":"403_CR49","doi-asserted-by":"publisher","first-page":"9728742","DOI":"10.1155\/2019\/9728742","volume":"2019","author":"Y Yang","year":"2019","unstructured":"Yang Y, Yu L, Zhou Z, Chen Y, Kou T (2019) Node importance ranking in complex networks based on multicriteria decision making. Math Probl Eng 2019(1):9728742","journal-title":"Math Probl Eng"},{"issue":"7","key":"403_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s44443-025-00207-y","volume":"37","author":"W Yang","year":"2025","unstructured":"Yang W, Liu Q, Zhang W (2025) Node importance ranking for influence maximization in social networks. J King Saud Univ Comput Inf Sci 37(7):1\u201323","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"403_CR51","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2017.10.018","volume":"93","author":"A Zareie","year":"2018","unstructured":"Zareie A, Sheikhahmadi A (2018) A hierarchical approach for influential node ranking in complex social networks. Expert Syst Appl 93:200\u2013211","journal-title":"Expert Syst Appl"},{"key":"403_CR52","doi-asserted-by":"publisher","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","journal-title":"Expert Syst Appl"},{"key":"403_CR53","doi-asserted-by":"crossref","unstructured":"Zhu X, Zhu J, Garg P, Wang G (2025) Target influence maximization problem under avoiding unexpected users interruption in online social network. Theor Comput Sci 115513","DOI":"10.1016\/j.tcs.2025.115513"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00403-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00403-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00403-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:51:13Z","timestamp":1770285073000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00403-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["403"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00403-w","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"26 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"9"}}