{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:58Z","timestamp":1740160318946,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T00:00:00Z","timestamp":1691539200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T00:00:00Z","timestamp":1691539200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Synergy Innovation in the Anhui Higher Education Institutions of China","award":["No. GXXT-2021-044"],"award-info":[{"award-number":["No. GXXT-2021-044"]}]},{"DOI":"10.13039\/501100018628","name":"Scientific Research Foundation of Education Department of Anhui Province of China","doi-asserted-by":"publisher","award":["Grant Nos. KJ2021A0506, KJ2021A0412"],"award-info":[{"award-number":["Grant Nos. KJ2021A0506, KJ2021A0412"]}],"id":[{"id":"10.13039\/501100018628","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"crossref","award":["Grant No. 2108085 MG237"],"award-info":[{"award-number":["Grant No. 2108085 MG237"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Open Fund of Key Laboratory of Anhui Higher Education Institutes","award":["Grant No.CS2021-02"],"award-info":[{"award-number":["Grant No.CS2021-02"]}]},{"name":"Science and Technology Planning Project of Wuhu City, Anhui Province, China","award":["Grant No. 2021jc1-2"],"award-info":[{"award-number":["Grant No. 2021jc1-2"]}]},{"name":"Research Start-Up Fund for Introducing Talents from Anhui Polytechnic University","award":["Grant No. 2021YQQ066"],"award-info":[{"award-number":["Grant No. 2021YQQ066"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s13042-023-01936-0","type":"journal-article","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T03:30:21Z","timestamp":1691551821000},"page":"719-737","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stemming competitive influence spread in social networks through binary ions motion optimization"],"prefix":"10.1007","volume":"15","author":[{"given":"Ping","family":"Kong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2226-9575","authenticated-orcid":false,"given":"Chao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Liangliang","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Ye","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Nenggang","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"1936_CR1","doi-asserted-by":"publisher","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 (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"1936_CR2","doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u2013429. https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"issue":"18","key":"1936_CR3","doi-asserted-by":"publisher","first-page":"3825","DOI":"10.1016\/j.comnet.2012.10.007","volume":"56","author":"S Brin","year":"2012","unstructured":"Brin S, Page L (2012) Reprint of: The anatomy of a large-scale hypertextual web search engine. Comput Netw 56(18):3825\u20133833. https:\/\/doi.org\/10.1016\/j.comnet.2012.10.007","journal-title":"Comput Netw"},{"key":"1936_CR4","doi-asserted-by":"publisher","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 946\u2013957. https:\/\/doi.org\/10.1137\/1.9781611973402.70","DOI":"10.1137\/1.9781611973402.70"},{"key":"1936_CR5","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/1963192.1963217","DOI":"10.1145\/1963192.1963217"},{"key":"1936_CR6","doi-asserted-by":"publisher","unstructured":"Gao G, Xiao M, Wu J, Huang H, Chen G (2018) Minimum cost seed selection for multiple influences diffusion in communities. In: 2018 IEEE 15th international conference on mobile ad hoc and sensor systems (MASS). IEEE, pp 263\u2013271. https:\/\/doi.org\/10.1137\/1.9781611973402.70","DOI":"10.1137\/1.9781611973402.70"},{"key":"1936_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-06595-2","author":"Z Liu","year":"2021","unstructured":"Liu Z, Li Y, Liu H (2021) Influence maximization based on maximum inner product search. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-021-06595-2","journal-title":"Neural Comput Appl"},{"key":"1936_CR8","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. https:\/\/doi.org\/10.1016\/j.ins.2016.07.012","journal-title":"Inf Sci"},{"key":"1936_CR9","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, Resul K (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":"6","key":"1936_CR10","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, Koh JM, Cheong KH (2021) Identifying influential spreaders in social networks through discrete moth-flame optimization. IEEE Trans Evol Comput 25(6):1091\u20131102. https:\/\/doi.org\/10.1109\/TEVC.2021.3081478","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1936_CR11","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","volume":"52","author":"A Bozorgi","year":"2016","unstructured":"Bozorgi A, Haghighi H, Zahedi MS, Rezvani M (2016) Incim: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52(6):1188\u20131199. https:\/\/doi.org\/10.1016\/j.ipm.2016.05.006","journal-title":"Inf Process Manag"},{"key":"1936_CR12","doi-asserted-by":"publisher","unstructured":"Martinez-Seis B, Li X, Wang X (2019) Measure community quality by attribute importance and density in social networks. In: 2019 IEEE 15th international conference on automation science and engineering (CASE). IEEE, pp 628\u2013633. https:\/\/doi.org\/10.1109\/COASE.2019.8842970","DOI":"10.1109\/COASE.2019.8842970"},{"key":"1936_CR13","doi-asserted-by":"publisher","unstructured":"Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE international conference on data mining. IEEE, pp 88\u201397. https:\/\/doi.org\/10.1109\/icdm.2010.118","DOI":"10.1109\/icdm.2010.118"},{"key":"1936_CR14","doi-asserted-by":"publisher","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: International workshop on web and internet economics. Springer, pp 306\u2013311. https:\/\/doi.org\/10.1007\/978-3-540-77105-0_31","DOI":"10.1007\/978-3-540-77105-0_31"},{"issue":"9","key":"1936_CR15","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1177\/0002764213490698","volume":"58","author":"SE Bor","year":"2014","unstructured":"Bor SE (2014) Using social network sites to improve communication between political campaigns and citizens in the 2012 election. Am Behav Sci 58(9):1195\u20131213. https:\/\/doi.org\/10.1177\/0002764213490698","journal-title":"Am Behav Sci"},{"key":"1936_CR16","doi-asserted-by":"publisher","first-page":"125536","DOI":"10.1016\/j.amc.2020.125536","volume":"388","author":"H Huang","year":"2021","unstructured":"Huang H, Chen Y, Ma Y (2021) Modeling the competitive diffusions of rumor and knowledge and the impacts on epidemic spreading. Appl Math Comput 388:125536. https:\/\/doi.org\/10.1016\/j.amc.2020.125536","journal-title":"Appl Math Comput"},{"key":"1936_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ins.2019.07.055","volume":"506","author":"L Yang","year":"2020","unstructured":"Yang L, Li Z, Giua A (2020) Containment of rumor spread in complex social networks. Inf Sci 506:113\u2013130. https:\/\/doi.org\/10.1016\/j.ins.2019.07.055","journal-title":"Inf Sci"},{"issue":"2","key":"1936_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1514888.1514892","volume":"3","author":"M Kimura","year":"2009","unstructured":"Kimura M, Saito K, Motoda H (2009) Blocking links to minimize contamination spread in a social network. ACM Trans Knowl Discov Data (TKDD) 3(2):1\u201323. https:\/\/doi.org\/10.1145\/1514888.1514892","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"1936_CR19","doi-asserted-by":"publisher","unstructured":"Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: International workshop on internet and network economics. Springer, pp 539\u2013550. https:\/\/doi.org\/10.1007\/978-3-642-17572-5_48","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"1936_CR20","doi-asserted-by":"publisher","unstructured":"He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 2012 Siam international conference on data mining. SIAM, pp 463\u2013474. https:\/\/doi.org\/10.1137\/1.9781611972825.40","DOI":"10.1137\/1.9781611972825.40"},{"key":"1936_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi A, Samet S, Kwisthout J, Wareham T (2017) Community-based influence maximization in social networks under a competitive linear threshold model. Knowl Based Syst 134:149\u2013158. https:\/\/doi.org\/10.1016\/j.knosys.2017.07.029","journal-title":"Knowl Based Syst"},{"issue":"1","key":"1936_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33\u201357. https:\/\/doi.org\/10.1007\/s11721-007-0002-0","journal-title":"Swarm Intell"},{"issue":"2","key":"1936_CR23","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1007\/s10489-022-03438-y","volume":"53","author":"C Wang","year":"2023","unstructured":"Wang C, Xu R-Q, Ma L, Zhao J, Wang L, Xie N-G, Cheong KH (2023) An efficient salp swarm algorithm based on scale-free informed followers with self-adaption weight. Appl Intell 53(2):1759\u20131791. https:\/\/doi.org\/10.1007\/s10489-022-03438-y","journal-title":"Appl Intell"},{"issue":"3","key":"1936_CR24","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1007\/s10462-022-10214-4","volume":"56","author":"F Pourpanah","year":"2023","unstructured":"Pourpanah F, Wang R, Lim CP, Wang X, Yazdani D (2023) A review of artificial fish swarm algorithms: recent advances and applications. Artif Intell Rev 56(3):1867\u20131903. https:\/\/doi.org\/10.1007\/s10462-022-10214-4","journal-title":"Artif Intell Rev"},{"key":"1936_CR25","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.asoc.2015.03.035","volume":"32","author":"B Javidy","year":"2015","unstructured":"Javidy B, Hatamlou A, Mirjalili S (2015) Ions motion algorithm for solving optimization problems. Appl Soft Comput 32:72\u201379. https:\/\/doi.org\/10.1016\/j.asoc.2015.03.035","journal-title":"Appl Soft Comput"},{"key":"1936_CR26","doi-asserted-by":"publisher","first-page":"106683","DOI":"10.1016\/j.asoc.2020.106683","volume":"96","author":"M Issa","year":"2020","unstructured":"Issa M, Abd Elaziz M (2020) Analyzing Covid-19 virus based on enhanced fragmented biological local aligner using improved ions motion optimization algorithm. Appl Soft Comput 96:106683. https:\/\/doi.org\/10.1016\/j.asoc.2020.106683","journal-title":"Appl Soft Comput"},{"issue":"6","key":"1936_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s00521-016-2529-8","volume":"29","author":"S Das","year":"2018","unstructured":"Das S, Bhattacharya A, Chakraborty AK (2018) Quasi-reflected ions motion optimization algorithm for short-term hydrothermal scheduling. Neural Comput Appl 29(6):123\u2013149. https:\/\/doi.org\/10.1007\/s00521-016-2529-8","journal-title":"Neural Comput Appl"},{"key":"1936_CR28","doi-asserted-by":"publisher","unstructured":"Pan J-S, Nguyen T-T, Chu S-C, Dao T-K, Ngo T-G (2018) A multi-objective ions motion optimization for robot path planning. In: International conference on engineering research and applications. Springer, pp 46\u201354. https:\/\/doi.org\/10.1007\/978-3-030-04792-4_8","DOI":"10.1007\/978-3-030-04792-4_8"},{"key":"1936_CR29","doi-asserted-by":"publisher","unstructured":"Nguyen T, Wang M, Pan J, Dao T, Ngo T (2020) A load economic dispatch based on ion motion optimization algorithm. In: Advances in intelligent information hiding and multimedia signal processing. Springer, pp 115\u2013125. https:\/\/doi.org\/10.1007\/978-981-13-9710-3_12","DOI":"10.1007\/978-981-13-9710-3_12"},{"key":"1936_CR30","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/502512.502525","DOI":"10.1145\/502512.502525"},{"issue":"2","key":"1936_CR31","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1007\/s11280-019-00750-5","volume":"23","author":"W Li","year":"2020","unstructured":"Li W, Fan Y, Mo J, Liu W, Wang C, Xin M, Jin Q (2020) Three-hop velocity attenuation propagation model for influence maximization in social networks. World Wide Web 23(2):1261\u20131273. https:\/\/doi.org\/10.1007\/s11280-019-00750-5","journal-title":"World Wide Web"},{"key":"1936_CR32","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.future.2017.05.044","volume":"78","author":"Y He","year":"2018","unstructured":"He Y, Xie H, Wong T-L, Wang X (2018) A novel binary artificial bee colony algorithm for the set-union knapsack problem. Future Gener Comput Syst 78:77\u201386. https:\/\/doi.org\/10.1016\/j.future.2017.05.044","journal-title":"Future Gener Comput Syst"},{"key":"1936_CR33","doi-asserted-by":"publisher","first-page":"104445","DOI":"10.1016\/j.knosys.2018.07.045","volume":"219","author":"Y He","year":"2021","unstructured":"He Y, Wang X (2021) Group theory-based optimization algorithm for solving knapsack problems. Knowl Based Syst 219:104445. https:\/\/doi.org\/10.1016\/j.knosys.2018.07.045","journal-title":"Knowl Based Syst"},{"key":"1936_CR34","doi-asserted-by":"publisher","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: 1997 IEEE International conference on systems, man, and cybernetics. Computational cybernetics and simulation, vol 5. IEEE, pp 4104\u20134108. https:\/\/doi.org\/10.1109\/icsmc.1997.637339","DOI":"10.1109\/icsmc.1997.637339"},{"issue":"3","key":"1936_CR35","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s11047-009-9175-3","volume":"9","author":"E Rashedi","year":"2010","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S (2010) Bgsa: binary gravitational search algorithm. Nat Comput 9(3):727\u2013745. https:\/\/doi.org\/10.1007\/s11047-009-9175-3","journal-title":"Nat Comput"},{"key":"1936_CR36","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.knosys.2018.05.009","volume":"154","author":"H Faris","year":"2018","unstructured":"Faris H, Mafarja MM, Heidari AA, Aljarah I, Ala\u2019m A-Z, Mirjalili S, Fujita H (2018) An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl Based Syst 154:43\u201367. https:\/\/doi.org\/10.1016\/j.knosys.2018.05.009","journal-title":"Knowl Based Syst"},{"key":"1936_CR37","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.neucom.2016.03.101","volume":"213","author":"E Emary","year":"2016","unstructured":"Emary E, Zawbaa HM, Hassanien AE (2016) Binary ant lion approaches for feature selection. Neurocomputing 213:54\u201365. https:\/\/doi.org\/10.1016\/j.neucom.2016.03.101","journal-title":"Neurocomputing"},{"key":"1936_CR38","doi-asserted-by":"publisher","first-page":"100770","DOI":"10.1016\/j.swevo.2020.100770","volume":"60","author":"Y Zhou","year":"2021","unstructured":"Zhou Y, Kang J, Kwong S, Wang X, Zhang Q (2021) An evolutionary multi-objective optimization framework of discretization-based feature selection for classification. Swarm Evol Comput 60:100770. https:\/\/doi.org\/10.1016\/j.swevo.2020.100770","journal-title":"Swarm Evol Comput"},{"key":"1936_CR39","unstructured":"Frank A, Asuncion A, et al (2010) Uci machine learning repository. http:\/\/archive.ics.uci.edu"},{"key":"1936_CR40","doi-asserted-by":"publisher","unstructured":"Guo G, Wang H, Bell D, Bi Y, Greer K (2003) Knn model-based approach in classification. In: On the move to meaningful internet systems 2003: CoopIS, DOA, and ODBASE: OTM confederated international conferences, CoopIS, DOA, and ODBASE 2003, Catania, Sicily, Italy, November 3\u20137, 2003. Proceedings. Springer, pp 986\u2013996. https:\/\/doi.org\/10.1007\/978-3-540-39964-3_62","DOI":"10.1007\/978-3-540-39964-3_62"},{"issue":"1","key":"1936_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"key":"1936_CR42","doi-asserted-by":"publisher","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Twenty-ninth AAAI conference on artificial intelligence, pp 4292\u20134293. https:\/\/doi.org\/10.1609\/aaai.v29i1.9277","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"1936_CR43","unstructured":"Rossi R, Ahmed N (2012) Network repository: a scientific network data repository with interactive visualization and mining tools. https:\/\/networkrepository.com"},{"key":"1936_CR44","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) Networkrepository: A graph data repository with visual interactive analytics. In: 29th AAAI conference on artificial intelligence, Austin, Texas, USA, pp 25\u201330. arXiv:1410.3560","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"1936_CR45","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web, pp 1343\u20131350. http:\/\/dx.doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"issue":"6684","key":"1936_CR46","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 \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"issue":"2","key":"1936_CR47","doi-asserted-by":"publisher","first-page":"027104","DOI":"10.1103\/physreve.72.027104","volume":"72","author":"J Duch","year":"2005","unstructured":"Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E 72(2):027104. https:\/\/doi.org\/10.1103\/physreve.72.027104","journal-title":"Phys Rev E"},{"issue":"1","key":"1936_CR48","first-page":"17","volume":"5","author":"P Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P, R\u00e9nyi A et al (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(1):17\u201360","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"1936_CR49","doi-asserted-by":"publisher","unstructured":"Arazkhani N, Meybodi MR, Rezvanian A (2019) Influence blocking maximization in social network using centrality measures. In: 2019 5th conference on knowledge based engineering and innovation (KBEI). IEEE, pp 492\u2013497. https:\/\/doi.org\/10.1109\/KBEI.2019.8734920","DOI":"10.1109\/KBEI.2019.8734920"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-023-01936-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-023-01936-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-023-01936-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T16:29:23Z","timestamp":1705076963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-023-01936-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,9]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1936"],"URL":"https:\/\/doi.org\/10.1007\/s13042-023-01936-0","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2023,8,9]]},"assertion":[{"value":"21 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2023","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 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":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}