{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T02:17:05Z","timestamp":1788229025091,"version":"build-2803163510"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T00:00:00Z","timestamp":1782000000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"vor","delay-in-days":72,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Hainan Provincial Natural Science Foundation of China","award":["623RC455, 623RC457, 425QN244"],"award-info":[{"award-number":["623RC455, 623RC457, 425QN244"]}]},{"name":"Scientific Research Fund of Hainan University","award":["KYQD (ZR)-22096, KYQD(ZR)-22097"],"award-info":[{"award-number":["KYQD (ZR)-22096, KYQD(ZR)-22097"]}]},{"name":"Lanzhou University-Hainan University Technical Service Project","award":["HD-KYH-2024424"],"award-info":[{"award-number":["HD-KYH-2024424"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Artif Intell"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Influence maximization (IM) aims to select a set of influential nodes in social networks to maximize information diffusion. However, existing methods struggle to balance solution accuracy and computational efficiency, restricting their practical deployment as network size increases. This paper proposes a Discrete Dung Beetle Optimizer for the IM problem. We discretize the Dung Beetle Optimizer and introduce an SD-based initialization to enhance population diversity and convergence speed. During search, the population is divided into functional roles with tailored discrete update rules, and crossover\u2013mutation operators are incorporated to strengthen global exploration. An adaptive local search mechanism is further designed to refine solutions by combining node degree and iterative progress. Experiments on six real-world social networks show that DDBO achieves stronger influence spread and higher time efficiency than state-of-the-art methods, effectively balancing accuracy and cost.<\/jats:p>","DOI":"10.1007\/s44163-026-01558-9","type":"journal-article","created":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T02:55:17Z","timestamp":1782010517000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An enhanced discrete dung beetle optimizer with multi-strategy for influence maximization"],"prefix":"10.1007","volume":"6","author":[{"given":"Xianhong","family":"Zeng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyue","family":"Mo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,21]]},"reference":[{"issue":"se4","key":"1558_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.14571\/brajets.v17.nse4.299-314","volume":"17","author":"R Huseynova","year":"2024","unstructured":"Huseynova R, Aliyeva N, Habibova K, Heydarov R. The evolution of the english language in the internet and social media era. Cadernos de Educa\u00e7\u00e3o Tecnologia e Sociedade. 2024;17(se4):299\u2013314.","journal-title":"Cadernos de Educa\u00e7\u00e3o Tecnologia e Sociedade"},{"issue":"146","key":"1558_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1080\/10670564.2023.2195811","volume":"33","author":"M Thun\u00f8","year":"2024","unstructured":"Thun\u00f8 M, Nielbo KL. The initial digitalization of chinese diplomacy (2019\u20132021): establishing global communication networks on twitter. J Contemp China. 2024;33(146):244\u201366.","journal-title":"J Contemp China"},{"issue":"3","key":"1558_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s12061-025-09696-w","volume":"18","author":"C Wu","year":"2025","unstructured":"Wu C, Wang Y. Did the pandemic accelerate spatio-temporal shifts in the role of urban open spaces in south china? evidence from social media. Appl Spat Anal Policy. 2025;18(3):95.","journal-title":"Appl Spat Anal Policy"},{"issue":"8","key":"1558_CR4","doi-asserted-by":"publisher","first-page":"4480","DOI":"10.1109\/TVCG.2023.3264577","volume":"30","author":"E Childs","year":"2023","unstructured":"Childs E, Mohammad F, Stevens L, Burbelo H, Awoke A, Rewkowski N, et al. An overview of enhancing distance learning through emerging augmented and virtual reality technologies. IEEE Trans Visual Comput Graph. 2023;30(8):4480\u201396.","journal-title":"IEEE Trans Visual Comput Graph"},{"issue":"4","key":"1558_CR5","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.3390\/encyclopedia4040109","volume":"4","author":"J Yu","year":"2024","unstructured":"Yu J, Bekerian D, Osback C. Navigating the digital landscape: challenges and barriers to effective information use on the internet. Encyclopedia. 2024;4(4):1665\u201380.","journal-title":"Encyclopedia"},{"key":"1558_CR6","doi-asserted-by":"crossref","unstructured":"Sai S, Sharma P, Gaur A, Chamola V. Pivotal role of digital twins in the metaverse: a review. Digit Commun Netw. 2024.","DOI":"10.1016\/j.dcan.2024.12.003"},{"key":"1558_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.neucom.2023.02.059","volume":"534","author":"F Kazemzadeh","year":"2023","unstructured":"Kazemzadeh F, Safaei AA, Mirzarezaee M, Afsharian S, Kosarirad H. Determination of influential nodes based on the communities\u2019 structure to maximize influence in social networks. Neurocomputing. 2023;534:18\u201328.","journal-title":"Neurocomputing"},{"issue":"1","key":"1558_CR8","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. Influence maximization on temporal networks: a review. Appl Netw Sci. 2024;9(1):16.","journal-title":"Appl Netw Sci"},{"key":"1558_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD international conference on knowledge discovery and data mining; 2003, p. 137\u2013146.","DOI":"10.1145\/956750.956769"},{"key":"1558_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101542","volume":"87","author":"Z Ou","year":"2024","unstructured":"Ou Z, Wang S. Finding robust and influential nodes on directed networks using a memetic algorithm. Swarm Evol Comput. 2024;87:101542.","journal-title":"Swarm Evol Comput"},{"key":"1558_CR11","doi-asserted-by":"crossref","unstructured":"Yusupov J, Palakonda V, Mallipeddi R, Veluvolu KC. Multi-objective evolutionary algorithm based on ensemble of initializations for overlapping community detection. In: 2021 international conference on electronics, information, and communication (ICEIC). IEEE; 2021. p. 1\u20137.","DOI":"10.1109\/ICEIC51217.2021.9369811"},{"key":"1558_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114168","volume":"167","author":"S Kianian","year":"2021","unstructured":"Kianian S, Rostamnia M. An efficient path-based approach for influence maximization in social networks. Expert Syst Appl. 2021;167:114168.","journal-title":"Expert Syst Appl"},{"key":"1558_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining; 2007, p. 420\u2013429.","DOI":"10.1145\/1281192.1281239"},{"key":"1558_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110653","volume":"146","author":"N Gasko","year":"2023","unstructured":"Gasko N, K\u00e9pes T, Lung RI, Suciu M. Identification of influential nodes with shapley influence maximization extremal optimization algorithm. Appl Soft Comput. 2023;146:110653.","journal-title":"Appl Soft Comput"},{"key":"1558_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111580","volume":"291","author":"C Guo","year":"2024","unstructured":"Guo C, Li W, Wang J, Yu X, Liu X, Luvembe AM, et al. Heterogeneous network influence maximization algorithm based on multi-scale propagation strength and repulsive force of propagation field. Knowl-Based Syst. 2024;291:111580.","journal-title":"Knowl-Based Syst"},{"key":"1558_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2025.126384","volume":"270","author":"W Zhu","year":"2025","unstructured":"Zhu W, Zhang K, Zhong J, Hou C, Ji J. Bigdn: An end-to-end influence maximization framework based on deep reinforcement learning and graph neural networks. Expert Syst Appl. 2025;270:126384.","journal-title":"Expert Syst Appl"},{"key":"1558_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.126326","volume":"268","author":"V Palakonda","year":"2025","unstructured":"Palakonda V, Tursunboev J, Kang J-M, Moon S. Metaheuristics for pruning convolutional neural networks: a comparative study. Expert Syst Appl. 2025;268:126326.","journal-title":"Expert Syst Appl"},{"key":"1558_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2024.104900","volume":"192","author":"S Munikoti","year":"2024","unstructured":"Munikoti S, Natarajan B, Halappanavar M. Gramer: Graph meta reinforcement learning for multi-objective influence maximization. J Parallel Distrib Comput. 2024;192:104900.","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"1558_CR19","first-page":"253","volume":"1","author":"J Tu","year":"2025","unstructured":"Tu J, Li H, Hu Y, Geng S, Li D, Wang L. A constrained multi-objective evolutionary algorithm based on dynamic clustering strategy. Int J Compl Appl Sci Technol. 2025;1(3):253\u201380.","journal-title":"Int J Compl Appl Sci Technol"},{"issue":"6","key":"1558_CR20","doi-asserted-by":"publisher","first-page":"8383","DOI":"10.1007\/s40747-024-01604-y","volume":"10","author":"J Tang","year":"2024","unstructured":"Tang J, Song S, Du Q, Yao Y, Qu J. Graph convolutional networks with the self-attention mechanism for adaptive influence maximization in social networks. Compl Intell Syst. 2024;10(6):8383\u2013401.","journal-title":"Compl Intell Syst"},{"key":"1558_CR21","doi-asserted-by":"crossref","unstructured":"Okamoto K, Chen W, Li X-Y. Ranking of closeness centrality for large-scale social networks. In: International workshop on frontiers in algorithmics. Springer; 2008. p. 186\u201395.","DOI":"10.1007\/978-3-540-69311-6_21"},{"issue":"11","key":"1558_CR22","doi-asserted-by":"publisher","first-page":"7749","DOI":"10.1007\/s10489-021-02283-9","volume":"51","author":"H Li","year":"2021","unstructured":"Li H, Zhang R, Zhao Z, Liu X, Yuan Y. Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization. Appl Intell. 2021;51(11):7749\u201365.","journal-title":"Appl Intell"},{"key":"1558_CR23","unstructured":"Khosroshahi AC, Afshord ST, Zarei B, Arasteh B. Influence maximization in social networks using improved genetic algorithm. IEEE Access. 2025."},{"key":"1558_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2025.113406","volume":"317","author":"SK Meena","year":"2025","unstructured":"Meena SK, Singh SS, Singh K. Pruning-enabled dynamic influence maximization using antlion optimization. Knowl-Based Syst. 2025;317:113406.","journal-title":"Knowl-Based Syst"},{"key":"1558_CR25","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M. Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. 2001. p. 57\u201366.","DOI":"10.1145\/502512.502525"},{"issue":"10","key":"1558_CR26","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W, Guo L. On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans Knowl Data Eng. 2015;27(10):2770\u201383.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1558_CR27","doi-asserted-by":"crossref","unstructured":"Liu W, Deng Z, Chen Y, Chen L. A greedy descent method for budget constrained continuous influence maximization in online social network. IEEE Trans Comput Soc Syst, 2025.","DOI":"10.1109\/TCSS.2025.3551651"},{"issue":"1","key":"1558_CR28","first-page":"29","volume":"11","author":"M Jalali","year":"2024","unstructured":"Jalali M, Hosseini-Pozveh M, Fatemi A. Applying heuristic-based greedy approaches for influence maximization-cost minimization in social networks. J Comput Secur. 2024;11(1):29\u201337.","journal-title":"J Comput Secur"},{"issue":"11","key":"1558_CR29","doi-asserted-by":"publisher","first-page":"12497","DOI":"10.1007\/s10489-021-03021-x","volume":"52","author":"H Li","year":"2022","unstructured":"Li H, Zhang R, Liu X. An efficient discrete differential evolution algorithm based on community structure for influence maximization. Appl Intell. 2022;52(11):12497\u2013515.","journal-title":"Appl Intell"},{"key":"1558_CR30","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. Efficient algorithms based on centrality measures for identification of top-k influential users in social networks. Inf Sci. 2020;527:88\u2013107.","journal-title":"Inf Sci"},{"issue":"5","key":"1558_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.056103","volume":"71","author":"E Estrada","year":"2005","unstructured":"Estrada E, Rodriguez-Velazquez JA. Subgraph centrality in complex networks. Phys Rev E-Statist Nonlinear Soft Matter Phys. 2005;71(5):056103.","journal-title":"Phys Rev E-Statist Nonlinear Soft Matter Phys"},{"key":"1558_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2020.124229","volume":"554","author":"M Wang","year":"2020","unstructured":"Wang M, Li W, Guo Y, Peng X, Li Y. Identifying influential spreaders in complex networks based on improved k-shell method. Physica A. 2020;554:124229.","journal-title":"Physica A"},{"issue":"1","key":"1558_CR33","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.dcan.2020.04.011","volume":"7","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Li X, Gan C. Identifying influential nodes in social networks via community structure and influence distribution difference. Digit Commun Netw. 2021;7(1):131\u20139.","journal-title":"Digit Commun Netw"},{"key":"1558_CR34","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","volume":"395","author":"J Bae","year":"2014","unstructured":"Bae J, Kim S. Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A. 2014;395:549\u201359.","journal-title":"Physica A"},{"issue":"3","key":"1558_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2024.103681","volume":"61","author":"Y Li","year":"2024","unstructured":"Li Y, Lu T, Li W, Zhang P. Hcckshell: A heterogeneous cross-comparison improved kshell algorithm for influence maximization. Inf Process Manag. 2024;61(3):103681.","journal-title":"Inf Process Manag"},{"issue":"2","key":"1558_CR36","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/net.21996","volume":"77","author":"TC Sharkey","year":"2021","unstructured":"Sharkey TC, Nurre Pinkley SG, Eisenberg DA, Alderson DL. In search of network resilience: an optimization-based view. Networks. 2021;77(2):225\u201354.","journal-title":"Networks"},{"key":"1558_CR37","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. Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci. 2016;367:600\u201314.","journal-title":"Inf Sci"},{"key":"1558_CR38","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. Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl. 2020;142:112971.","journal-title":"Expert Syst Appl"},{"key":"1558_CR39","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, et al. Ddse: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl. 2018;103:119\u201330.","journal-title":"J Netw Comput Appl"},{"issue":"6","key":"1558_CR40","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. Identifying influential spreaders in social networks through discrete moth-flame optimization. IEEE Trans Evol Comput. 2021;25(6):1091\u2013102.","journal-title":"IEEE Trans Evol Comput"},{"key":"1558_CR41","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ins.2022.05.119","volume":"607","author":"V Palakonda","year":"2022","unstructured":"Palakonda V, Kang J-M, Jung H. An adaptive neighborhood based evolutionary algorithm with pivot-solution based selection for multi-and many-objective optimization. Inf Sci. 2022;607:126\u201352.","journal-title":"Inf Sci"},{"issue":"6","key":"1558_CR42","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M. Threshold models of collective behavior. Am J Sociol. 1978;83(6):1420\u201343.","journal-title":"Am J Sociol"},{"key":"1558_CR43","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Gao C, Wang Y, Si W, Xie K. Simulated annealing based influence maximization in social networks. In: Proceedings of the AAAI conference on artificial intelligence, vol. 25. 2011. p. 127\u201332.","DOI":"10.1609\/aaai.v25i1.7838"},{"issue":"7","key":"1558_CR44","doi-asserted-by":"publisher","first-page":"7305","DOI":"10.1007\/s11227-022-04959-6","volume":"79","author":"J Xue","year":"2023","unstructured":"Xue J, Shen B. Dung beetle optimizer: a new meta-heuristic algorithm for global optimization. J Supercomput. 2023;79(7):7305\u201336.","journal-title":"J Supercomput"},{"key":"1558_CR45","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S. Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. 2009. p. 199\u2013208.","DOI":"10.1145\/1557019.1557047"},{"issue":"10","key":"1558_CR46","first-page":"0164393","volume":"11","author":"X Wang","year":"2016","unstructured":"Wang X, Zhang X, Zhao C, Yi D. Maximizing the spread of influence via generalized degree discount. PLoS ONE. 2016;11(10):0164393.","journal-title":"PLoS ONE"},{"issue":"1\u20137","key":"1558_CR47","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. The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst. 1998;30(1\u20137):107\u201317.","journal-title":"Comput Netw ISDN Syst"}],"container-title":["Discover Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44163-026-01558-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-026-01558-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-026-01558-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T01:26:39Z","timestamp":1788225999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44163-026-01558-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,21]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["1558"],"URL":"https:\/\/doi.org\/10.1007\/s44163-026-01558-9","relation":{},"ISSN":["2731-0809"],"issn-type":[{"value":"2731-0809","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,21]]},"assertion":[{"value":"24 February 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","label":"Ethics approval and consent to participate","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","label":"Consent to publish","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":3,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"998"}}