{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:53:24Z","timestamp":1768870404616,"version":"3.49.0"},"reference-count":52,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:00:00Z","timestamp":1759881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,13]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Social media plays an important role in today\u2019s life. The dissemination of messages and the exchange of information within social networks have been extensively researched and analyzed. In social media, influence maximization (IM) is the problem of finding a small subset of the most influential nodes and maximizing influence over the entire network by their combined influence-spreading capability. We propose a non-dominated archived multi-objective harmony search (NAMHS) algorithm to identify influencers in social networks. This algorithm can generate a set of Pareto optimal harmony vectors for addressing the multi-objective IM problems. Our proposed algorithm is compared with two other state-of-the-art algorithms, and the performance of our algorithm is higher. We also propose a dynamic non-dominated archived multi-objective harmony search (DNAMHS) algorithm for dynamic networks and demonstrate that it performs better than the current algorithms. Moreover, the time complexity of the proposed NAMHS and DNAMHS algorithms is comparable with that of existing algorithms. The deterministic linear threshold model is used for influence propagation in both static and dynamic networks.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf109","type":"journal-article","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T11:50:08Z","timestamp":1756813808000},"page":"203-220","source":"Crossref","is-referenced-by-count":0,"title":["A non-dominated archived multi-objective harmony search algorithm for identifying influencers in social networks"],"prefix":"10.1093","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5290-3531","authenticated-orcid":false,"given":"Taniya","family":"Chatterjee","sequence":"first","affiliation":[{"name":"Department of Computer Science and Technology, University of North Bengal , Darjeeling 734013, West Bengal ,","place":["India"]}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5955-1546","authenticated-orcid":false,"given":"Puja","family":"Bhakta","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, University of North Bengal , Darjeeling 734013, West Bengal ,","place":["India"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1144-9511","authenticated-orcid":false,"given":"Mili","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, University of North Bengal , Darjeeling 734013, West Bengal ,","place":["India"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6607-2707","authenticated-orcid":false,"given":"Rahul","family":"Karmakar","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Burdwan , Burdwan 713104, West Bengal ,","place":["India"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7562-119X","authenticated-orcid":false,"given":"Debaditya","family":"Barman","sequence":"additional","affiliation":[{"name":"Department of Computer and System Sciences , Visva-Bharati, Santiniketan 731235, West Bengal ,","place":["India"]}]}],"member":"286","published-online":{"date-parts":[[2025,10,8]]},"reference":[{"key":"2026011907123854900_ref1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.procs.2014.05.384","article-title":"A note on influence maximization in social networks from local to global and beyond","volume":"30","author":"Zhou","year":"2014","journal-title":"Procedia Comput Sci"},{"key":"2026011907123854900_ref2","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","article-title":"Influence maximization on social graphs: a survey","volume":"30","author":"Li","year":"2018","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2026011907123854900_ref3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-020-00704-0","article-title":"MLPR: efficient influence maximization in linear threshold propagation model using linear programming","volume":"11","author":"Ghayour-Baghbani","year":"2021","journal-title":"Social Network Anal Min"},{"key":"2026011907123854900_ref4","first-page":"1","article-title":"Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata","volume":"9","author":"Goldenberg","year":"2001","journal-title":"Acad Mark Sci Rev"},{"key":"2026011907123854900_ref5","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1086\/226707","article-title":"Threshold models of collective behavior","volume":"83","author":"Granovetter","year":"1978","journal-title":"Am J Sociol"},{"key":"2026011907123854900_ref6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/956750.956769","article-title":"Maximizing the spread of influence through a social network","volume-title":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, NY, USA","author":"Kempe","year":"2003"},{"key":"2026011907123854900_ref7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/s10878-011-9393-3","article-title":"The complexity of influence maximization problem in the deterministic linear threshold model","volume":"24","author":"Lu","year":"2012","journal-title":"J Comb Optim"},{"key":"2026011907123854900_ref8","first-page":"67","article-title":"Prediction of information diffusion probabilities for independent cascade model","volume-title":"International conference on knowledge-based and intelligent information and engineering systems","author":"Saito","year":"2008"},{"issue":"5","key":"2026011907123854900_ref9","article-title":"A search space reduction-based progressive evolutionary algorithm for influence maximization in social networks","volume":"10","author":"Zhang","year":"2022","journal-title":"IEEE Trans Comput Social Syst"},{"key":"2026011907123854900_ref10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","article-title":"A new heuristic optimization algorithm: harmony search","volume":"76","author":"Geem","year":"2001","journal-title":"Simulation."},{"key":"2026011907123854900_ref11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.asoc.2015.12.028","article-title":"An improved harmony search based energy-efficient routing algorithm for wireless sensor networks","volume":"41","author":"Zeng","year":"2016","journal-title":"Appl Soft Comput"},{"key":"2026011907123854900_ref12","doi-asserted-by":"publisher","first-page":"106273","DOI":"10.1016\/j.asoc.2020.106273","article-title":"A novel harmony search algorithm and its application to data clustering","volume":"92","author":"Talaei","year":"2020","journal-title":"Appl Soft Comput"},{"key":"2026011907123854900_ref13","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1093\/comjnl\/bxaa139","article-title":"Text summarization as a multi-objective optimization task: applying harmony search to extractive multi-document summarization","volume":"65","author":"Bidoki","year":"2020","journal-title":"Comput J"},{"key":"2026011907123854900_ref14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/502512.502525","article-title":"Mining the network value of customers","volume-title":"Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Domingos","year":"2001"},{"key":"2026011907123854900_ref15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/1557019.1557047","article-title":"Efficient influence maximization in social networks","volume-title":"Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Chen","year":"2009"},{"key":"2026011907123854900_ref16","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1145\/1281192.1281239","article-title":"Cost-effective outbreak detection in networks","volume-title":"Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Leskovec","year":"2007"},{"key":"2026011907123854900_ref17","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1145\/1835804.1835934","article-title":"Scalable influence maximization for prevalent viral marketing in large-scale social networks","volume-title":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Chen","year":"2010"},{"key":"2026011907123854900_ref18","first-page":"211","article-title":"SIMPATH: an efficient algorithm for influence maximization under the linear threshold model","volume-title":"2011 IEEE 11th international conference on data mining","author":"Goyal"},{"key":"2026011907123854900_ref19","first-page":"3530","article-title":"Model-independent online learning for influence maximization","volume-title":"International Conference on Machine Learning","author":"Vaswani","year":"2017"},{"key":"2026011907123854900_ref20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","article-title":"DDSE: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks","volume":"103","author":"Cui","year":"2018","journal-title":"J Netw Comput Appl"},{"key":"2026011907123854900_ref21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.gr.2021.05.006","article-title":"Mother snail labors for posterity in bed of mid-cretaceous amber","volume":"97","author":"Jochum","year":"2021","journal-title":"Gondw Res"},{"key":"2026011907123854900_ref22","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCI.2022.3222050","article-title":"A multi-transformation evolutionary framework for influence maximization in social networks","volume":"18","author":"Wang","year":"2023","journal-title":"IEEE Comput Intell Mag"},{"key":"2026011907123854900_ref23","doi-asserted-by":"publisher","first-page":"119138","DOI":"10.1016\/j.eswa.2022.119138","article-title":"Influence maximization considering fairness: a multi-objective optimization approach with prior knowledge","volume":"214","author":"Gong","year":"2023","journal-title":"Expert Syst Appl"},{"key":"2026011907123854900_ref24","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1016\/j.physa.2018.08.045","article-title":"IMPC: influence maximization based on multi-neighbor potential in community networks","volume":"512","author":"Shang","year":"2018","journal-title":"Physica A"},{"key":"2026011907123854900_ref25","doi-asserted-by":"publisher","first-page":"127721","DOI":"10.1016\/j.amc.2022.127721","article-title":"Influence maximization through exploring structural information","volume":"442","author":"Li","year":"2023","journal-title":"Appl Math Comput"},{"key":"2026011907123854900_ref26","doi-asserted-by":"crossref","first-page":"118702","DOI":"10.1016\/j.eswa.2022.118702","article-title":"TSIFIM: a three-stage iterative framework for influence maximization in complex networks","volume":"212","author":"Dong","year":"2023","journal-title":"Expert Syst Appl"},{"key":"2026011907123854900_ref27","article-title":"Targeted and budgeted influence maximization in social networks under deterministic linear threshold model","author":"Gursoy"},{"key":"2026011907123854900_ref28","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ins.2022.11.041","article-title":"Targeted influence maximization in competitive social networks","volume":"619","author":"Liang","year":"2023","journal-title":"Inform Sci"},{"key":"2026011907123854900_ref29","first-page":"96","article-title":"Influence maximization in network by genetic algorithm on linear threshold model","volume-title":"International Conference on Computational Science and Its Applications","author":"da Silva","year":"2018"},{"key":"2026011907123854900_ref30","first-page":"1192","article-title":"Online influence maximization under linear threshold model","volume-title":"Advances in Neural Information Processing Systems","author":"Li","year":"2020"},{"key":"2026011907123854900_ref31","doi-asserted-by":"publisher","volume-title":"Networks","DOI":"10.1002\/net.22161"},{"key":"2026011907123854900_ref32","doi-asserted-by":"crossref","first-page":"106623","DOI":"10.1016\/j.knosys.2020.106623","article-title":"A multi-objective linear threshold influence spread model solved by swarm intelligence-based methods","volume":"212","author":"Olivares","year":"2021","journal-title":"Knowledge-Based Syst"},{"issue":"6","key":"2026011907123854900_ref33","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxad128","volume":"67","journal-title":"The Computer Journal"},{"key":"2026011907123854900_ref34","first-page":"1305","article-title":"Uncharted but not uninfluenced: Influence maximization with an uncertain network","author":"Wilder","year":"2017"},{"key":"2026011907123854900_ref35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40649-018-0056-8","article-title":"Extended methods for influence maximization in dynamic networks","volume":"5","author":"Murata","year":"2018","journal-title":"Comput Social Networks"},{"key":"2026011907123854900_ref36","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature."},{"key":"2026011907123854900_ref37","first-page":"946","article-title":"Maximizing social influence in nearly optimal time","volume-title":"Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms","author":"Borgs","year":"2014"},{"key":"2026011907123854900_ref38","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/2588555.2593670","article-title":"Influence maximization: near-optimal time complexity meets practical efficiency","volume-title":"Proceedings of the 2014 ACM SIGMOD international conference on Management of data","author":"Tang","year":"2014"},{"key":"2026011907123854900_ref39","first-page":"10718","article-title":"Dynamic influence maximization","volume":"34","author":"Peng","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026011907123854900_ref40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s42979-023-02453-1","article-title":"Influence maximization in dynamic networks using reinforcement learning","volume":"5","author":"Dizaji","year":"2024","journal-title":"SN Comput Science"},{"key":"2026011907123854900_ref41","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ins.2016.08.023","article-title":"Social influence modeling using information theory in mobile social networks","volume":"379","author":"Peng","year":"2017","journal-title":"Inform Sci"},{"key":"2026011907123854900_ref42","doi-asserted-by":"publisher","first-page":"60","DOI":"10.36548\/jismac.2021.1.006","article-title":"Novel influence maximization algorithm for social network behavior management","volume":"3","author":"Sivaganesan","year":"2021","journal-title":"J ISMAC"},{"key":"2026011907123854900_ref43","doi-asserted-by":"publisher","first-page":"110062","DOI":"10.1016\/j.asoc.2023.110062","article-title":"ABEM: an adaptive agent-based evolutionary approach for influence maximization in dynamic social networks","volume":"136","author":"Li","year":"2023","journal-title":"Appl Soft Comput"},{"key":"2026011907123854900_ref44","doi-asserted-by":"publisher","first-page":"126480","DOI":"10.1016\/j.physa.2021.126480","article-title":"An improved influence maximization method for social networks based on genetic algorithm","volume":"586","author":"Lotf","year":"2022","journal-title":"Physica A"},{"key":"2026011907123854900_ref45","doi-asserted-by":"publisher","first-page":"3057","DOI":"10.1007\/s11042-021-11606-4","article-title":"GNPA: a hybrid model for social influence maximization in dynamic networks","volume":"83","author":"Agarwal","year":"2024","journal-title":"Multimed Tools Appl"},{"key":"2026011907123854900_ref46","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika."},{"key":"2026011907123854900_ref47","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","article-title":"An efficient approach to nondominated sorting for evolutionary multiobjective optimization","volume":"19","author":"Zhang","year":"2014","journal-title":"IEEE Trans Evol Comput"},{"key":"2026011907123854900_ref48","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1186\/s40537-017-0076-5","article-title":"Identification of top-K nodes in large networks using Katz centrality","volume":"4","author":"Zhan","year":"2017","journal-title":"J Big Data"},{"key":"2026011907123854900_ref49","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans Evol Comput"},{"key":"2026011907123854900_ref50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-00185-7_1","article-title":"Harmony search as a metaheuristic algorithm","volume-title":"Music-inspired harmony search algorithm: theory and applications","author":"Yang","year":"2009"},{"key":"2026011907123854900_ref51","doi-asserted-by":"publisher","first-page":"38","DOI":"10.5120\/11897-7956","article-title":"A binary harmony search algorithm for solving the maximum clique problem","volume":"69","author":"Afkhami","year":"2013","journal-title":"Int J Comput Appl"},{"key":"2026011907123854900_ref52","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cie.2014.03.018","article-title":"A multi-objective harmony search algorithm to optimize multi-server location\u2013allocation problem in congested systems","volume":"72","author":"Hajipour","year":"2014","journal-title":"Comput Ind Eng"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/1\/203\/64550368\/bxaf109.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/1\/203\/64550368\/bxaf109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T12:12:46Z","timestamp":1768824766000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/69\/1\/203\/8277728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,8]]},"references-count":52,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,10,8]]},"published-print":{"date-parts":[[2026,1,13]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf109","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,1]]},"published":{"date-parts":[[2025,10,8]]}}}