{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T19:44:21Z","timestamp":1773949461042,"version":"3.50.1"},"reference-count":47,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100004775","name":"Gansu Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["21JR11RA061"],"award-info":[{"award-number":["21JR11RA061"]}],"id":[{"id":"10.13039\/501100004775","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,24]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The influence maximization (IM) problem has received great attention in the field of social network analysis, and its analysis results can provide reliable basis for decision makers when promoting products or political viewpoints. IM problem aims to select a set of seed users from social networks and maximize the number of users expected to be influenced. Most previous studies on the IM problem focused only on the single-objective problem of maximizing the influence spread of the seed set, ignoring the cost of the seed set, which causes decision makers to be unable to develop effective management strategies. In this work, the IM problem is formulated as a multi-objective IM problem that considers the cost of the seed set. An improved multi-objective particle swarm optimization (IMOPSO) algorithm is proposed to solve this problem. In the IMOPSO algorithm, the initialization strategy of Levy flight based on degree value is used to improve the quality of the initial solution, and the local search strategy based on greedy mechanism is designed to improve the Pareto Frontier distribution and promote algorithm convergence. Experimental results on six real social networks demonstrate that the proposed IMOPSO algorithm is effective, reducing runtime while providing competitive solutions.<\/jats:p>","DOI":"10.1093\/comjnl\/bxad128","type":"journal-article","created":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T18:34:05Z","timestamp":1706034845000},"page":"2137-2150","source":"Crossref","is-referenced-by-count":4,"title":["Influence Maximization in Social Networks Using an Improved Multi-Objective Particle Swarm Optimization"],"prefix":"10.1093","volume":"67","author":[{"given":"Ping","family":"Wang","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, Lanzhou University , Lanzhou, Gansu 730000 , P.R. China"},{"name":"School of Traffic and Transportation, Lanzhou Jiaotong University , Lanzhou, Gansu 730070 , P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruisheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Lanzhou University , Lanzhou, Gansu 730000 , P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2024,1,22]]},"reference":[{"key":"2024062414161527100_ref1","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1109\/TCYB.2021.3123081","article-title":"Gravity-based community vulnerability evaluation model in social networks: GBCVE","volume":"53","author":"Wen","year":"2021","journal-title":"IEEE Trans. Cybern."},{"key":"2024062414161527100_ref2","doi-asserted-by":"crossref","first-page":"101655","DOI":"10.1016\/j.techsoc.2021.101655","article-title":"Investigating online social media users\u2019 behaviors for social commerce recommendations","volume":"66","author":"Liao","year":"2021","journal-title":"Technol. Soc."},{"key":"2024062414161527100_ref3","doi-asserted-by":"crossref","first-page":"113183","DOI":"10.1016\/j.eswa.2020.113183","article-title":"Evolutionary multiobjective optimization to target social network influentials in viral marketing","volume":"147","author":"Robles","year":"2020","journal-title":"Exp. Syst. Appl."},{"key":"2024062414161527100_ref4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.tcs.2019.03.006","article-title":"Viral marketing of online game by DS decomposition in social networks","volume":"803","author":"Gao","year":"2020","journal-title":"Theor. Comput. Sci."},{"key":"2024062414161527100_ref5","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1016\/j.ejor.2020.07.046","article-title":"Incentive rate determination in viral marketing","volume":"289","author":"Tavasoli","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"2024062414161527100_ref6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.tcs.2018.01.017","article-title":"Recommending links through influence maximization","volume":"764","author":"D\u2019Angelo","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"2024062414161527100_ref7","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2020.01.040","article-title":"Targeted influence maximization under a multifactor-based information propagation model","volume":"519","author":"Li","year":"2020","journal-title":"Inform. Sci."},{"key":"2024062414161527100_ref8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3449023","article-title":"Link recommendation for social influence maximization","volume":"15","author":"Cor\u00f3","year":"2021","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"2024062414161527100_ref9","article-title":"An effective scheme to address influence maximization for opinion formation in social networks","volume":"30","author":"He","year":"2019","journal-title":"Trans. Emerg. Telecommun. Technol."},{"key":"2024062414161527100_ref10","first-page":"15","article-title":"Action-aware restricted stream influence maximization model to identify social influencers","volume-title":"Social Computing and Social Media: Applications in Marketing, Learning, and Health: 13th International Conference, SCSM 2021, held as part of the 23rd HCI International Conference, HCII 2021, Virtual Event, Proceedings, Part II, 24-29 July","author":"Almutairy","year":"2021"},{"key":"2024062414161527100_ref11","doi-asserted-by":"crossref","first-page":"102818","DOI":"10.1016\/j.ipm.2021.102818","article-title":"An influence maximization method based on crowd emotion under an emotion-based attribute social network","volume":"59","author":"Li","year":"2022","journal-title":"Inf. Process. Manag."},{"key":"2024062414161527100_ref12","first-page":"1","article-title":"On the influence blocking maximization for minimizing the spreading of fake information in social media","volume-title":"2020 Spring Simulation Conference (SpringSim), Fairfax, VA, USA, 18-21 May","author":"Alorini","year":"2020"},{"key":"2024062414161527100_ref13","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1109\/TCSS.2020.3014135","article-title":"Defensive modeling of fake news through online social networks","volume":"7","author":"Shrivastava","year":"2020","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"2024062414161527100_ref14","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116635","article-title":"DSS: a hybrid deep model for fake news detection using propagation tree and stance network","volume":"198","author":"Davoudi","year":"2022","journal-title":"Exp. Syst. Appl."},{"key":"2024062414161527100_ref15","doi-asserted-by":"crossref","first-page":"10466","DOI":"10.3390\/su141710466","article-title":"The influence of fake news on social media: analysis and verification of web content during the covid-19 pandemic by advanced machine learning methods and natural language processing","volume":"14","author":"Nistor","year":"2022","journal-title":"Sustainability"},{"key":"2024062414161527100_ref16","first-page":"1301","article-title":"Influence and profit: two sides of the coin","volume-title":"2013 IEEE 13th International Conference on Data Mining, Dallas, TX, USA, 07-10 December","author":"Zhu","year":"2013"},{"key":"2024062414161527100_ref17","doi-asserted-by":"crossref","first-page":"2285","DOI":"10.1007\/s11831-021-09663-x","article-title":"A review of multi-objective optimization: methods and algorithms in mechanical engineering problems","volume":"29","author":"Pereira","year":"2021","journal-title":"Arch. Comput. Methods Eng."},{"key":"2024062414161527100_ref18","doi-asserted-by":"crossref","first-page":"106436","DOI":"10.1016\/j.asoc.2020.106436","article-title":"Identifying influential spreaders using multi-objective artificial bee colony optimization","volume":"94","author":"Sheikhahmadi","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"2024062414161527100_ref19","doi-asserted-by":"crossref","first-page":"102669","DOI":"10.1016\/j.ipm.2021.102669","article-title":"Genetic algorithm based rumor mitigation in online social networks through counter-rumors: a multi-objective optimization","volume":"58","author":"Parimi","year":"2021","journal-title":"Inf. Process. Manag."},{"key":"2024062414161527100_ref20","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":"Knowl.-Based Syst."},{"key":"2024062414161527100_ref21","first-page":"57","article-title":"Mining the network value of customers","volume-title":"Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, D.C., 24-27 August","author":"Domingos","year":"2001"},{"key":"2024062414161527100_ref22","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, San Francisco, California, 26-29 August","author":"Kempe","year":"2003"},{"key":"2024062414161527100_ref23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/1963192.1963217","article-title":"CELF++ optimizing the greedy algorithm for influence maximization in social networks","volume-title":"Proceedings of the 20th International Conference Companion on World Wide Web, Hyderabad, India, 28 March-1 April","author":"Goyal","year":"2011"},{"key":"2024062414161527100_ref24","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, Paris, France, 28 June-1 July","author":"Chen","year":"2009"},{"key":"2024062414161527100_ref25","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","article-title":"INCIM: a community-based algorithm for influence maximization problem under the linear threshold model","volume":"52","author":"Bozorgi","year":"2016","journal-title":"Inf. Process. Manag."},{"key":"2024062414161527100_ref26","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.07.004","article-title":"A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks","volume":"187","author":"Tang","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"2024062414161527100_ref27","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2020.102973","article-title":"LIDDE: a differential evolution algorithm based on local-influence-descending search strategy for influence maximization in social networks","volume":"178","author":"Qiu","year":"2021","journal-title":"J. Netw. Comput. Appl."},{"key":"2024062414161527100_ref28","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101102","article-title":"Graph embedding based ant colony optimization for negative influence propagation suppression under cost constraints","volume":"72","author":"Chen","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"2024062414161527100_ref29","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-030-39033-4_2","article-title":"Multi-objective biogeography-based optimization for influence maximization-cost minimization in social networks","volume-title":"Biologically Inspired Techniques in Many-Criteria Decision Making: International Conference on Biologically Inspired Techniques in Many-Criteria Decision Making (BITMDM-2019), Balasore, India, 19-20 December","author":"De","year":"2020"},{"key":"2024062414161527100_ref30","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume-title":"Proceedings of ICNN\u201995-International Conference on Neural Networks, Perth, WA, Australia, 27 November-01 December","author":"Kennedy","year":"1995"},{"key":"2024062414161527100_ref31","first-page":"69","article-title":"A modified particle swarm optimizer","volume-title":"1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98TH8360), Anchorage, AK, USA, 04-09 May","author":"Shi","year":"1998"},{"key":"2024062414161527100_ref32","doi-asserted-by":"crossref","first-page":"1790","DOI":"10.3390\/electronics12081790","article-title":"A multi-objective crow search algorithm for influence maximization in social networks","volume":"12","author":"Wang","year":"2023","journal-title":"Electronics"},{"key":"2024062414161527100_ref33","doi-asserted-by":"crossref","first-page":"4104","DOI":"10.1109\/ICSMC.1997.637339","article-title":"A discrete binary version of the particle swarm algorithm","volume-title":"1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, Orlando, FL, USA, 12-15 October","author":"Kennedy","year":"1997"},{"key":"2024062414161527100_ref34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","article-title":"S-shaped versus v-shaped transfer functions for binary particle swarm optimization","volume":"9","author":"Mirjalili","year":"2013","journal-title":"Swarm Evol. Comput."},{"key":"2024062414161527100_ref35","first-page":"21","article-title":"Binary particle swarm optimization: challenges and new solutions","volume":"6","author":"Nezamabadi-pour","year":"2008","journal-title":"CSI J. Comput. Sci. Eng."},{"key":"2024062414161527100_ref36","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","volume-title":"Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, USA, 25-30 January","author":"Rossi","year":"2015"},{"key":"2024062414161527100_ref37","first-page":"221","article-title":"Edge weight prediction in weighted signed networks","volume-title":"2016 IEEE 16th International Conference on Data Mining (ICDM), Barcelona, Spain, 12-15 December","author":"Kumar","year":"2016"},{"key":"2024062414161527100_ref38","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/3159652.3159729","article-title":"REV2: fraudulent user prediction in rating platforms","volume-title":"Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, Marina Del Rey, CA, USA, 5-9 February","author":"Kumar","year":"2018"},{"key":"2024062414161527100_ref39","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/2487788.2488173","article-title":"Konect: the Koblenz network collection","volume-title":"Proceedings of the 22nd International Conference on World Wide Web, Rio de Janeiro, Brazil, 13-17 May","author":"Kunegis","year":"2013"},{"key":"2024062414161527100_ref40","first-page":"658","article-title":"Bowling alone and trust decline in social network sites","volume-title":"2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, Chengdu, China, 12-14 December","author":"Massa","year":"2009"},{"key":"2024062414161527100_ref41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/srep02980","article-title":"The anatomy of a scientific rumor","volume":"3","author":"De Domenico","year":"2013","journal-title":"Sci. Rep."},{"key":"2024062414161527100_ref42","first-page":"741","article-title":"The Slashdot zoo: mining a social network with negative edges","volume-title":"Proceedings of the 18th International Conference on World Wide Web, Madrid, Spain, 20-24 April","author":"Kunegis","year":"2009"},{"key":"2024062414161527100_ref43","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1504\/IJBIC.2011.042259","article-title":"Bat algorithm for multi-objective optimisation","volume":"3","author":"Yang","year":"2011","journal-title":"Int. J. Bio-Inspir. Comput."},{"key":"2024062414161527100_ref44","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2012.08.023","article-title":"Black hole: a new heuristic optimization approach for data clustering","volume":"222","author":"Hatamlou","year":"2013","journal-title":"Inform. Sci."},{"key":"2024062414161527100_ref45","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TEVC.2004.826071","article-title":"Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients","volume":"8","author":"Ratnaweera","year":"2004","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2024062414161527100_ref46","doi-asserted-by":"crossref","first-page":"3658","DOI":"10.1016\/j.asoc.2011.01.037","article-title":"A novel particle swarm optimization algorithm with adaptive inertia weight","volume":"11","author":"Nickabadi","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"2024062414161527100_ref47","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1504\/IJBIC.2013.055093","article-title":"Bat algorithm: literature review and applications","volume":"5","author":"Yang","year":"2013","journal-title":"Int. J. Bio-Inspir. Comput."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/6\/2137\/58309283\/bxad128.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/6\/2137\/58309283\/bxad128.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T14:56:38Z","timestamp":1719240998000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/6\/2137\/7491975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,22]]},"references-count":47,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,1,22]]},"published-print":{"date-parts":[[2024,6,24]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxad128","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,6]]},"published":{"date-parts":[[2024,1,22]]}}}