{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T07:42:56Z","timestamp":1775893376492,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T00:00:00Z","timestamp":1632960000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T00:00:00Z","timestamp":1632960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-095322-B-C22"],"award-info":[{"award-number":["PGC2018-095322-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-101216-B-I00"],"award-info":[{"award-number":["PGC2018-101216-B-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012818","name":"Comunidad de Madrid","doi-asserted-by":"publisher","award":["S2018\/TCS-4566"],"award-info":[{"award-number":["S2018\/TCS-4566"]}],"id":[{"id":"10.13039\/100012818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["Y2018\/EMT-5062"],"award-info":[{"award-number":["Y2018\/EMT-5062"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011011","name":"Junta de Andaluc\u00eda","doi-asserted-by":"publisher","award":["A-TIC-284-UGR18"],"award-info":[{"award-number":["A-TIC-284-UGR18"]}],"id":[{"id":"10.13039\/501100011011","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006393","name":"Universidad de Granada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006393","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The evolution and spread of social networks have attracted the interest of the scientific community in the last few years. Specifically, several new interesting problems, which are hard to solve, have arisen in the context of viral marketing, disease analysis, and influence analysis, among others. Companies and researchers try to find the elements that maximize profit, stop pandemics, etc. This family of problems is collected under the term Social Network Influence Maximization problem (SNIMP), whose goal is to find the most influential users (commonly known as seeds) in a social network, simulating an influence diffusion model. SNIMP is known to be an<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathcal {NP}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>NP<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>-hard problem and, therefore, an exact algorithm is not suitable for solving it optimally in reasonable computing time. The main drawback of this optimization problem lies on the computational effort required to evaluate a solution. Since each node is infected with a certain probability, the objective function value must be calculated through a Monte Carlo simulation, resulting in a computationally complex process. The current proposal tries to overcome this limitation by considering a metaheuristic algorithm based on the Greedy Randomized Adaptive Search Procedure (GRASP) framework to design a quick solution procedure for the SNIMP. Our method consists of two distinct stages: construction and local search. The former is based on static features of the network, which notably increases its efficiency since it does not require to perform any simulation during construction. The latter involves a local search based on an intelligent neighborhood exploration strategy to find the most influential users based on swap moves, also aiming for an efficient processing. Experiments performed on 7 well-known social network datasets with 5 different seed set sizes confirm that the proposed algorithm is able to provide competitive results in terms of quality and computing time when comparing it with the best algorithms found in the state of the art.<\/jats:p>","DOI":"10.1007\/s12652-021-03510-4","type":"journal-article","created":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T03:53:13Z","timestamp":1632973993000},"page":"3767-3779","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A quick GRASP-based method for influence maximization in social networks"],"prefix":"10.1007","volume":"14","author":[{"given":"Isaac","family":"Lozano-Osorio","sequence":"first","affiliation":[]},{"given":"Jes\u00fas","family":"S\u00e1nchez-Oro","sequence":"additional","affiliation":[]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5112-5629","authenticated-orcid":false,"given":"\u00d3scar","family":"Cord\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"3510_CR1","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2020) A survey on influence maximization in a social network. Knowl Inf Syst 62:3417\u20133455. https:\/\/doi.org\/10.1007\/s10115-020-01461-4","journal-title":"Knowl Inf Syst"},{"key":"3510_CR2","unstructured":"Barab\u00e1si, Albert-L\u00e1szl\u00f3, P\u00f3sfai M\u00e1rton (2016) Network science. Cambridge University Press, Cambridge. ISBN: 9781107076266 1107076269, http:\/\/barabasi.com\/networksciencebook\/"},{"key":"3510_CR3","doi-asserted-by":"publisher","unstructured":"Bucur D, Iacca G (2016) Infuence maximization in social networks with genetic algorithms. In: Applications of evolutionary com-putation. Springer International Publishing, Berlin, pp 379\u2013392. https:\/\/doi.org\/10.1007\/978-3-319-31204-0_25","DOI":"10.1007\/978-3-319-31204-0_25"},{"key":"3510_CR4","doi-asserted-by":"publisher","unstructured":"Bucur D, Giovanni I, Andrea M, Giovanni S, Al-berto T (2017) Multi-objective evolutionary algorithms for influence maximization in social networks, pp 221\u2013233. https:\/\/doi.org\/10.1007\/978-3-319-55849-3_15","DOI":"10.1007\/978-3-319-55849-3_15"},{"key":"3510_CR5","doi-asserted-by":"publisher","unstructured":"Bucur D, Giovanni I, Andrea M, Giovanni S, Al-berto T (2018a) Evaluating surrogate models for multi-objective in-fluence maximization in social networks. In: Proceedings of the genetic and evolutionary computation conference companion on GECCO 18. ACM Press. https:\/\/doi.org\/10.1145\/3205651.3208238","DOI":"10.1145\/3205651.3208238"},{"key":"3510_CR6","doi-asserted-by":"publisher","unstructured":"Bucur D, Giovanni I, Andrea M, Giovanni S, Al-berto T (2018b) Improving multi-objective evolutionary in fluence maximization in social networks. In: Applications of evolutionary computation. Springer International Publishing, Berlin, pp 117\u2013124. https:\/\/doi.org\/10.1007\/978-3-319-77538-8_9","DOI":"10.1007\/978-3-319-77538-8_9"},{"key":"3510_CR7","doi-asserted-by":"publisher","unstructured":"Chen W, Yajun W, Siyu Y (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining-KDD 09. ACM Press. https:\/\/doi.org\/10.1145\/1557019.1557047","DOI":"10.1145\/1557019.1557047"},{"key":"3510_CR8","unstructured":"Christakis NA, Fowler JH (2009) Connected: the surprising power of our social networks and how they shape our lives. Little, Brown Spark"},{"key":"3510_CR10","unstructured":"D\u2019angelo A, Aditya A, Kang-Xing J, Yun-Fang J, Levy K, Oleksandr M, Yishan W (2009) Targeting advertisements in a social network. US Patent App. 12\/195321"},{"issue":"2","key":"3510_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-637789)90002-3","volume":"8","author":"T Feo","year":"1989","unstructured":"Feo T, Resende Mauricio AGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67\u201371. https:\/\/doi.org\/10.1016\/0167-6377(89)90002-3","journal-title":"Oper Res Lett"},{"issue":"5","key":"3510_CR12","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"Feo TA, Resende Mauricio GC, Stuart HS (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 42(5):860\u2013878. https:\/\/doi.org\/10.1287\/opre.42.5.860","journal-title":"Oper Res"},{"key":"3510_CR13","first-page":"1","volume":"2020","author":"SG Gil-Borr\u00e1s","year":"2020","unstructured":"Gil-Borr\u00e1s SG, Pardo E, Antonio A-A, Abraham D (2020) GRASP with Variable Neighborhood Descent for the on- line order batching problem. J Glob Optim 2020:1\u201331","journal-title":"J Glob Optim"},{"issue":"3","key":"3510_CR14","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/mci.2016.2572538","volume":"11","author":"M Gong","year":"2016","unstructured":"Gong M, Chao S, Chao D, Lijia M, Bo S (2016) An efficient memetic algorithm for influence maximization in social networks. IEEE Comput Intell Mag 11(3):22\u201333. https:\/\/doi.org\/10.1109\/mci.2016.2572538","journal-title":"IEEE Comput Intell Mag"},{"key":"3510_CR15","doi-asserted-by":"publisher","unstructured":"Goyal A, Wei L, Laks VSL (2011) CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web WWW 11. ACM Press. https:\/\/doi.org\/10.1145\/1963192.1963217","DOI":"10.1145\/1963192.1963217"},{"key":"3510_CR16","doi-asserted-by":"publisher","unstructured":"Hansen P, Mladenovi\u0107 N (2006) First vs. best improvement: an empirical study. In: Discrete Applied Mathematics 154.5. IV ALIO\/EURO workshop on applied combinatorial optimization, pp 802\u2013817. Issn: 0166-218X. https:\/\/doi.org\/10.1016\/j.dam.2005.05.020, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X05003070","DOI":"10.1016\/j.dam.2005.05.020"},{"key":"3510_CR17","doi-asserted-by":"publisher","unstructured":"Jiaguo L, Guo J, Yang Z, Zhang W, Jocshi A (2014) Improved algorithms of CELF and CELF++ for influence maximization. J Eng Sci Technol Rev 7(3):32\u201338. https:\/\/doi.org\/10.25103\/jestr.073.05","DOI":"10.25103\/jestr.073.05"},{"key":"3510_CR18","doi-asserted-by":"publisher","unstructured":"Kempe D, Jon K, \u00c9va T (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 KDD 03. ACM Press. https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"3510_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe D, Jon K, Eva T (2015) Maximizing the spread of influence through a social network. Theory Comput 11(1):105\u2013147. https:\/\/doi.org\/10.4086\/toc.2015.v011a004","journal-title":"Theory Comput"},{"key":"3510_CR20","unstructured":"Khalil EB, Dilkina B, Song L (2013)\u2018CuttingEdge: influence minimization in networks. In: Workshop on frontiers of network analysis: methods, models, and applications at NIPS. url: files\/papers\/CuttingEdge.pdf"},{"issue":"11","key":"3510_CR21","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1016\/0277-9536(85)90269-2","volume":"21","author":"AS Klovdahl","year":"1985","unstructured":"Klovdahl AS (1985) Social networks and the spread of infectious diseases: the AIDS example. Soc Sci Med 21(11):1203\u20131216. https:\/\/doi.org\/10.1016\/0277-9536(85)90269-2","journal-title":"Soc Sci Med"},{"key":"3510_CR9","doi-asserted-by":"publisher","unstructured":"Lamont CCC, Gary B, van Veldhuizen DA (2007) Evolutionary algorithms for solving multi-objective problems. Springer, US. https:\/\/doi.org\/10.1007\/978-0-387-36797-2","DOI":"10.1007\/978-0-387-36797-2"},{"key":"3510_CR22","doi-asserted-by":"publisher","unstructured":"Lappas T, Evimaria T, Dimitrios G, Heikki M (2010) Finding effectors in social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining KDD 10. ACM Press. https:\/\/doi.org\/10.1145\/1835804.1835937","DOI":"10.1145\/1835804.1835937"},{"key":"3510_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep08665","volume":"5","author":"G Lawyer","year":"2015","unstructured":"Lawyer G (2015) Understanding the influence of all nodes in a network. Sci Rep 5:1. https:\/\/doi.org\/10.1038\/srep08665","journal-title":"Sci Rep"},{"issue":"2","key":"3510_CR24","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/tkde.2014.2330833","volume":"27","author":"J-R Lee","year":"2015","unstructured":"Lee J-R, Chung C-W (2015) A Query approach for influence maximization on specific users in social networks. IEEE Trans Knowl Data Eng 27(2):340\u2013353. https:\/\/doi.org\/10.1109\/tkde.2014.2330833","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3510_CR25","doi-asserted-by":"publisher","unstructured":"Leskovec J, Andreas K, Carlos G, Christos F, Jeanne Van B, Natalie G (2007) Cost-effective outbreak detection in networks. Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining KDD 07. ACM Press. https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"issue":"7","key":"3510_CR26","doi-asserted-by":"publisher","first-page":"e102199","DOI":"10.1371\/journal.pone.0102199","volume":"9","author":"D Li","year":"2014","unstructured":"Li D, Zhi-Ming X, Nilanjan C, Anika G, Katia S, Sheng L (2014) Polarity related influence maximization in signed social networks. PLoS ONE 9(7):e102199. https:\/\/doi.org\/10.1371\/journal.pone.0102199 ((Ed. by Sergio G\u00f3mez))","journal-title":"PLoS ONE"},{"key":"3510_CR27","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.neucom.2017.03.003","volume":"260","author":"D Li","year":"2017","unstructured":"Li D, Wang C, Zhang S, Zhou G, Chu D, Chong W (2017) Positive influence maximization in signed social networks based on simulated annealing. Neurocomputing 260:69\u201378. https:\/\/doi.org\/10.1016\/j.neucom.2017.03.003","journal-title":"Neurocomputing"},{"issue":"8","key":"3510_CR28","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1109\/tkde.2013.106","volume":"26","author":"B Liu","year":"2014","unstructured":"Liu B, Gao C, Yifeng Z, Dong X, Yeow MC (2014) Influence spreading path and its application to the time constrained social influence maximization problem and beyond. IEEE Trans Knowl Data Eng 26(8):1904\u20131917. https:\/\/doi.org\/10.1109\/tkde.2013.106","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"3510_CR29","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1109\/tevc.2019.2901012","volume":"23","author":"Y Liu","year":"2019","unstructured":"Liu Y, Xi W, Jurgen K (2019) Framework of evolutionary algorithm for investigation of influential nodes in complex networks. IEEE Trans Evol Comput 23(6):1049\u20131063. https:\/\/doi.org\/10.1109\/tevc.2019.2901012","journal-title":"IEEE Trans Evol Comput"},{"key":"3510_CR30","doi-asserted-by":"crossref","unstructured":"Luo C, Kainan C, Xiaolong Z, Zeng D (2014) Time critical disinformation influence minimization in online social networks. In: 2014 IEEE joint intelligence and security informatics conference, pp 68\u201374","DOI":"10.1109\/JISIC.2014.20"},{"key":"3510_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.10.011","volume":"91","author":"R Mart\u00ed","year":"2018","unstructured":"Mart\u00ed R, Anna M-G, Jes\u00fas S-O, Abraham D (2018) Tabu search for the dynamic Bipartite Drawing Problem. Comput Oper Res 91:1\u201312 ((issn: 0305-0548))","journal-title":"Comput Oper Res"},{"issue":"6","key":"3510_CR32","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/jsac.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6):1084\u20131094. https:\/\/doi.org\/10.1109\/jsac.2013.130610","journal-title":"IEEE J Sel Areas Commun"},{"key":"3510_CR33","doi-asserted-by":"crossref","unstructured":"Nguyen Hung T, Thai My T, Dinh Thang N (2016) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale net- works. In: Proceedings of the 2016 international conference on management of data. SIGMOD \u201916. San Francisco, California, USA: association for computing machinery, pp 695\u2013710. isbn: 9781450335317. https:\/\/doi.org\/10.1145\/2882903.2915207. url: https:\/\/doi.org\/10.1145\/2882903.2915207","DOI":"10.1145\/2882903.2915207"},{"issue":"6","key":"3510_CR34","doi-asserted-by":"publisher","first-page":"3798","DOI":"10.1109\/tnet.2016.2556719","volume":"24","author":"J Ok","year":"2016","unstructured":"Ok J, Youngmi J, Jinwoo S, Yung Y (2016) On maximizing diffusion speed over social networks with strategic users. IEEE\/ACM Trans Netw 24(6):3798\u20133811. https:\/\/doi.org\/10.1109\/tnet.2016.2556719","journal-title":"IEEE\/ACM Trans Netw"},{"key":"3510_CR35","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ins.2016.08.023","volume":"379","author":"S Peng","year":"2017","unstructured":"Peng S, Aimin Y, Lihong C, Shui Y, Dongqing X (2017) Social influence modeling using information theory in mobile social networks. Inf Sci 379:146\u2013159. https:\/\/doi.org\/10.1016\/j.ins.2016.08.023","journal-title":"Inf Sci"},{"key":"3510_CR36","doi-asserted-by":"crossref","first-page":"e12540","DOI":"10.1111\/exsy.12540","volume":"2020","author":"S P\u00e9rez-Pel\u00f3","year":"2020","unstructured":"P\u00e9rez-Pel\u00f3 S, Jes\u00fas S-O, Abraham D (2020) Finding weaknesses in networks using greedy randomized adaptive search procedure and path relinking. Expert Syst 2020:e12540","journal-title":"Expert Syst"},{"issue":"1","key":"3510_CR37","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3390\/electronics8010023","volume":"8","author":"S P\u00e9rez-Pel\u00f3","year":"2019","unstructured":"P\u00e9rez-Pel\u00f3 S, Jes\u00fas S-O, Ra\u00fal M-S, Abraham D (2019) On the analysis of the influence of the evaluation metric in community detection over social networks. Electronics 8(1):23","journal-title":"Electronics"},{"key":"3510_CR38","doi-asserted-by":"publisher","unstructured":"Qipeng Y, Shi R, Zhou C, Wang P, Guo L (2015) Topic-aware social influence minimization. In: Proceedings of the 24th International Conference on World Wide Web. WWW \u201915 Companion. Florence, Italy: Association for Computing Machinery, pp 139\u2013140. ISBN: 9781450334730. https:\/\/doi.org\/10.1145\/2740908.2742767","DOI":"10.1145\/2740908.2742767"},{"key":"3510_CR39","doi-asserted-by":"publisher","unstructured":"Resende M, Celso GC, Ribeiro C (2013) GRASP: greedy randomized adaptive search procedures. In: Search methodologies. Springer US, pp 287\u2013312. https:\/\/doi.org\/10.1007\/978-1-4614-6940-7_11","DOI":"10.1007\/978-1-4614-6940-7_11"},{"issue":"3","key":"3510_CR40","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"M Resende","year":"2010","unstructured":"Resende M, Rafael-Mart\u00ed GC, Micael G, Abraham D (2010) GRASP and path relinking for the max-min diversity problem. Comput Oper Res 37(3):498\u2013508. https:\/\/doi.org\/10.1016\/j.cor.2008.05.011","journal-title":"Comput Oper Res"},{"key":"3510_CR41","doi-asserted-by":"publisher","unstructured":"Reza Z, Abbasi MA, Liu H (2014) Social media mining: an introduction. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/CBO9781139088510","DOI":"10.1017\/CBO9781139088510"},{"key":"3510_CR42","doi-asserted-by":"publisher","unstructured":"Richardson M, Rakesh A, Pedro D (2003) Trust management for the semantic web. In: Lecture notes in computer science. Springer, Berlin, Heidelberg, pp 351\u2013368. https:\/\/doi.org\/10.1007\/978-3-540-39718-2_23","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"3510_CR43","doi-asserted-by":"publisher","unstructured":"Robles JF, Manuel C, Oscar C (2020) Evolutionary multiobjective optimization to target social network influentials in viral marketing. In: Expert systems with applications, vol 147, p 113183. ISSN: 0957-4174. https:\/\/doi.org\/10.1016\/j.eswa.2020.113183, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417420300099","DOI":"10.1016\/j.eswa.2020.113183"},{"key":"3510_CR44","doi-asserted-by":"publisher","first-page":"100614","DOI":"10.1016\/j.swevo.2019.100614","volume":"51","author":"C Salavati","year":"2019","unstructured":"Salavati C, Abdollahpouri A (2019) Identifying influential nodes based on ant colony optimization to maximize profit in social networks. Swarm Evol Comput 51:100614. https:\/\/doi.org\/10.1016\/j.swevo.2019.100614","journal-title":"Swarm Evol Comput"},{"key":"3510_CR45","doi-asserted-by":"publisher","unstructured":"Samadi M, Nagi R, Semenov A, Nikolaev A (2018) Seed activation scheduling for influence maximization in social networks. Omega 77:96\u2013114. https:\/\/doi.org\/10.1016\/j.omega.2017.06.002","DOI":"10.1016\/j.omega.2017.06.002"},{"key":"3510_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep05547","volume":"4","author":"P Sen","year":"2014","unstructured":"Sen P, Lev M, Jos\u00e9 SA, Zheng ZA, Makse H (2014) Searching for superspreaders of information in real-world social media. Sci Rep 4:1. https:\/\/doi.org\/10.1038\/srep05547","journal-title":"Sci Rep"},{"key":"3510_CR47","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.eswa.2018.07.038","volume":"114","author":"A \u015eim\u015fek","year":"2018","unstructured":"\u015eim\u015fek A, Kara R (2018) Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks. Expert Syst Appl 114:224\u2013236. https:\/\/doi.org\/10.1016\/j.eswa.2018.07.038","journal-title":"Expert Syst Appl"},{"issue":"5","key":"3510_CR48","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/tpds.2014.2320515","volume":"26","author":"G Song","year":"2015","unstructured":"Song G, Xiabing Z, Yu W, Xie K (2015) Influence maximization on large-scale mobile social network: a divide- and-conquer method. IEEE Trans Parallel Distrib Syst 26(5):1379\u20131392. https:\/\/doi.org\/10.1109\/tpds.2014.2320515","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3510_CR49","doi-asserted-by":"publisher","unstructured":"Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/cbo9780511815478","DOI":"10.1017\/cbo9780511815478"},{"issue":"1","key":"3510_CR50","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/tnet.2016.2563397","volume":"25","author":"G Tong","year":"2017","unstructured":"Tong G, Weili W, Shaojie T, Ding-Zhu D (2017) Adaptive influence maximization in dynamic social networks. IEEE\/ACM Trans Netw 25(1):112\u2013125. https:\/\/doi.org\/10.1109\/tnet.2016.2563397","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"3510_CR51","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/tcss.2016.2627811","volume":"3","author":"GA Tong","year":"2016","unstructured":"Tong GA, Shasha L, Weili W, Ding-Zhu D (2016) Effector detection in social networks. IEEE Trans Comput Soc Syst 3(4):151\u2013163. https:\/\/doi.org\/10.1109\/tcss.2016.2627811","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"10","key":"3510_CR52","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/TKDE.2017.2728064","volume":"29","author":"B Wang","year":"2017","unstructured":"Wang B, Ge C, Luoyi F, Li S, Xinbing W (2017) Drimux: dynamic rumor influence minimization with user experience in social networks. IEEE Trans Knowl Data Eng 29(10):2168\u20132181","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6684","key":"3510_CR53","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of small-world networks. Nature 393(6684):440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"issue":"9","key":"3510_CR54","first-page":"4053","volume":"50","author":"C Wei-Neng","year":"2019","unstructured":"Wei-Neng C, Tan D-Z, Yang Q, Gu T, Zhang J (2019) Ant colony optimization for the control of pollutant spreading on social networks. IEEE Trans Cybern 50(9):4053\u20134065","journal-title":"IEEE Trans Cybern"},{"key":"3510_CR55","doi-asserted-by":"crossref","unstructured":"Xinjue W, Deng K, Li J, Yu JX, Jensen SC, Yang X (2018) Targeted influence minimization in social networks. In: Phung D, Tseng VS, Webb GI, Ho B, Ganji M, Rashidi L (eds) Advances in knowledge discovery and data mining. Springer International Publishing, Cham, pp 689\u2013 700. ISBN: 978-3-319-93040-4","DOI":"10.1007\/978-3-319-93040-4_54"},{"key":"3510_CR56","doi-asserted-by":"publisher","unstructured":"Yang W-S, Weng S-X (2012) Application of the ant colony optimization algorithm to competitive viral marketing. In: Lecture notes in computer science. Springer, Berlin, Heidelberg, pp 1\u20138. https:\/\/doi.org\/10.1007\/978-3-642-30448-4_1","DOI":"10.1007\/978-3-642-30448-4_1"},{"issue":"2","key":"3510_CR57","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/tnet.2015.2394793","volume":"24","author":"H Zhang","year":"2016","unstructured":"Zhang H, Dung TN, Huiling Z, My TT (2016) Least cost influence maximization across multiple social networks. IEEE\/ACM Trans Netw 24(2):929\u2013939. https:\/\/doi.org\/10.1109\/tnet.2015.2394793","journal-title":"IEEE\/ACM Trans Netw"},{"key":"3510_CR58","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.physa.2017.02.067","volume":"478","author":"K Zhang","year":"2017","unstructured":"Zhang K, Haifeng D, Feldman MW (2017) Maximizing influence in a social network: improved results using a genetic algorithm. Phys A 478:20\u201330. https:\/\/doi.org\/10.1016\/j.physa.2017.02.067","journal-title":"Phys A"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-021-03510-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-021-03510-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-021-03510-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T18:31:33Z","timestamp":1699554693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-021-03510-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,30]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["3510"],"URL":"https:\/\/doi.org\/10.1007\/s12652-021-03510-4","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,30]]},"assertion":[{"value":"4 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}