{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:41:56Z","timestamp":1758123716397,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10489-023-04884-y","type":"journal-article","created":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T10:01:56Z","timestamp":1691056916000},"page":"25070-25091","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Steering the spread of influence adaptively in social networks via a discrete scheduled particle swarm optimization"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6822-0590","authenticated-orcid":false,"given":"Jianxin","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shihui","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jimao","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuqing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,3]]},"reference":[{"key":"4884_CR1","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.ins.2015.04.024","volume":"13","author":"S Yu","year":"2022","unstructured":"Yu S, Abbas J, Draghici A et al (2022) Social media application as a new paradigm for business communication: the role of covid-19 knowledge, social distancing, and preventive attitudes. Front Psychol 13:903\u2013082. https:\/\/doi.org\/10.1016\/j.ins.2015.04.024","journal-title":"Front Psychol"},{"key":"4884_CR2","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J (2003) Maximizing the spread of influence through a social network. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"4884_CR3","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, et\u00a0al. (2007) Cost-effective outbreak detection in networks. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"4884_CR4","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) Celf$$++$$: optimizing the greedy algorithm for influence maximization in social networks. In: International conference companion on World Wide Web, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"4884_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ins.2015.04.024","volume":"316","author":"S Kundu","year":"2015","unstructured":"Kundu S, Pal SK (2015) Deprecation based greedy strategy for target set selection in large scale social networks. Inf Sci 316:107\u2013122. https:\/\/doi.org\/10.1016\/j.ins.2015.04.024","journal-title":"Inf Sci"},{"key":"4884_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X et al (2017) Cofim: A community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88\u2013100. https:\/\/doi.org\/10.1016\/j.knosys.2016.09.029","journal-title":"Knowl Based Syst"},{"key":"4884_CR7","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.ins.2016.03.029","volume":"355","author":"W Xu","year":"2016","unstructured":"Xu W, Liang W, Lin X et al (2016) Finding top-k influential users in social networks under the structural diversity model. Inf Sci 355:110\u2013126. https:\/\/doi.org\/10.1016\/j.ins.2016.03.029","journal-title":"Inf Sci"},{"issue":"1","key":"4884_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3301286","volume":"52","author":"R Bian","year":"2019","unstructured":"Bian R, Koh YS, Dobbie G et al (2019) Identifying top-k nodes in social networks: A survey. ACM Comput Surv (CSUR) 52(1):1\u201333. https:\/\/doi.org\/10.1145\/3301286","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"12","key":"4884_CR9","doi-asserted-by":"publisher","first-page":"e0168","DOI":"10.1145\/3301286","volume":"11","author":"CP Sankar","year":"2016","unstructured":"Sankar CP, Asharaf S, Kumar KS (2016) Learning from bees: An approach for influence maximization on viral campaigns. Plos One 11(12):e0168-125. https:\/\/doi.org\/10.1145\/3301286","journal-title":"Plos One"},{"issue":"3","key":"4884_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","volume":"11","author":"M Gong","year":"2016","unstructured":"Gong M, Song C, Duan C et al (2016) An efficient memetic algorithm for influence maximization in social networks. IEEE Comput Intell Magazine 11(3):22\u201333. https:\/\/doi.org\/10.1109\/MCI.2016.2572538","journal-title":"IEEE Comput Intell Magazine"},{"issue":"104","key":"4884_CR11","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.knosys.2019.07.004","volume":"187","author":"J Tang","year":"2020","unstructured":"Tang J, Zhang R, Wang P et al (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl Based Syst 187(104):833. https:\/\/doi.org\/10.1016\/j.knosys.2019.07.004","journal-title":"Knowl Based Syst"},{"issue":"6","key":"4884_CR12","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 et al (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":"1","key":"4884_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep30062","volume":"6","author":"F Morone","year":"2016","unstructured":"Morone F, Min B, Bo L et al (2016) Collective influence algorithm to find influencers via optimal percolation in massively large social media. Sci Reports 6(1):1\u201311. https:\/\/doi.org\/10.1038\/srep30062","journal-title":"Sci Reports"},{"key":"4884_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.physa.2016.09.038","volume":"466","author":"MAMA Kermani","year":"2016","unstructured":"Kermani MAMA, Ardestani SFF, Aliahmadi A et al (2016) A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes. Physica A Statistical Mechanics & Its Applications 466:570\u2013582. https:\/\/doi.org\/10.1016\/j.physa.2016.09.038","journal-title":"Physica A Statistical Mechanics & Its Applications"},{"key":"4884_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ins.2017.06.018","volume":"415\u2013416","author":"S Kim","year":"2017","unstructured":"Kim S, Kim D, Oh J et al (2017) Scalable and parallelizable influence maximization with random walk ranking and rank merge pruning. Inf Sci 415\u2013416:171\u2013189. https:\/\/doi.org\/10.1016\/j.ins.2017.06.018","journal-title":"Inf Sci"},{"issue":"1","key":"4884_CR16","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ejor.2020.06.028","volume":"289","author":"E G\u00fcney","year":"2021","unstructured":"G\u00fcney E, Leitner M, Ruthmair M et al (2021) Large-scale influence maximization via maximal covering location. Eur J Oper Res 289(1):144\u2013164. https:\/\/doi.org\/10.1016\/j.ejor.2020.06.028","journal-title":"Eur J Oper Res"},{"key":"4884_CR17","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1613\/jair.3278","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin D, Krause A (2011) Adaptive submodularity: Theory and applications in active learning and stochastic optimization. J Artif Intell Res 42:427\u2013486. https:\/\/doi.org\/10.1613\/jair.3278","journal-title":"J Artif Intell Res"},{"issue":"3","key":"4884_CR18","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TCSS.2018.2852742","volume":"5","author":"D Goldenberg","year":"2018","unstructured":"Goldenberg D, Sela A, Shmueli E (2018) Timing matters: Influence maximization in social networks through scheduled seeding. IEEE Trans Comput Social Syst 5(3):621\u2013638. https:\/\/doi.org\/10.1109\/TCSS.2018.2852742","journal-title":"IEEE Trans Comput Social Syst"},{"key":"4884_CR19","doi-asserted-by":"publisher","unstructured":"Lu J, Zhang J, Sheng J (2022) Enhanced multi-swarm cooperative particle swarm optimizer. Swarm Evol Comput 69. https:\/\/doi.org\/10.1016\/j.swevo.2021.100989","DOI":"10.1016\/j.swevo.2021.100989"},{"key":"4884_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ins.2021.07.093","volume":"579","author":"R Wang","year":"2021","unstructured":"Wang R, Hao K, Chen L et al (2021) A novel hybrid particle swarm optimization using adaptive strategy. Inf Sci 579:231\u2013250. https:\/\/doi.org\/10.1016\/j.ins.2021.07.093","journal-title":"Inf Sci"},{"issue":"1","key":"4884_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-017-00937-8","volume":"7","author":"J Jankowski","year":"2017","unstructured":"Jankowski J, Br\u00f3dka P, Kazienko P et al (2017) Balancing speed and coverage by sequential seeding in complex networks. Sci Reports 7(1):1\u201311. https:\/\/doi.org\/10.1038\/s41598-017-00937-8","journal-title":"Sci Reports"},{"issue":"6","key":"4884_CR22","doi-asserted-by":"publisher","first-page":"2844","DOI":"10.1109\/TKDE.2020.3015387","volume":"34","author":"C Feng","year":"2020","unstructured":"Feng C, Fu L, Jiang B et al (2020) Neighborhood matters: Influence maximization in social networks with limited access. IEEE Trans Knowl Data Eng 34(6):2844\u20132859. https:\/\/doi.org\/10.1109\/TKDE.2020.3015387","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4884_CR23","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1613\/jair.1.12997","volume":"74","author":"W Chen","year":"2022","unstructured":"Chen W, Peng B, Schoenebeck G et al (2022) Adaptive greedy versus non-adaptive greedy for influence maximization. J Artif Int Res 74:303\u2013351. https:\/\/doi.org\/10.1613\/jair.1.12997","journal-title":"J Artif Int Res"},{"key":"4884_CR24","doi-asserted-by":"publisher","unstructured":"Chen W, Peng B (2019) On adaptivity gaps of influence maximization under the independent cascade model with full adoption feedback. arXiv preprint arXiv:1907.01707, https:\/\/doi.org\/10.48550\/arXiv.1907.01707","DOI":"10.48550\/arXiv.1907.01707"},{"key":"4884_CR25","doi-asserted-by":"publisher","unstructured":"Verma KK, Singh BM (2021) Deep multi-model fusion for human activity recognition using evolutionary algorithms. Int J Interact Multimedia Artif Intell 7(2). https:\/\/doi.org\/10.9781\/ijimai.2021.08.008","DOI":"10.9781\/ijimai.2021.08.008"},{"key":"4884_CR26","doi-asserted-by":"publisher","unstructured":"Zaborski M, Wo\u017aniak M, Ma\u0144dziuk J (2022) Multidimensional red fox meta-heuristic for complex optimization. Appl Soft Comput 131. https:\/\/doi.org\/10.1016\/j.asoc.2022.109774","DOI":"10.1016\/j.asoc.2022.109774"},{"issue":"7","key":"4884_CR27","doi-asserted-by":"publisher","first-page":"38","DOI":"10.9781\/ijimai.2022.10.006","volume":"7","author":"MA Khemchandani","year":"2022","unstructured":"Khemchandani MA, Jadhav SM, Iyer BR (2022) Brain tumor segmentation and identification using particle imperialist deep convolutional neural network in mri images. Int J Interact Multimedia Artif Intell 7(7):38\u201347. https:\/\/doi.org\/10.9781\/ijimai.2022.10.006","journal-title":"Int J Interact Multimedia Artif Intell"},{"key":"4884_CR28","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.future.2022.12.004","volume":"141","author":"M Wo\u017aniak","year":"2023","unstructured":"Wo\u017aniak M, Wieczorek M, Si\u0142ka J (2023) Bilstm deep neural network model for imbalanced medical data of iot systems. Future Gener Comput Syst 141:489\u2013499. https:\/\/doi.org\/10.1016\/j.future.2022.12.004","journal-title":"Future Gener Comput Syst"},{"issue":"4","key":"4884_CR29","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1109\/TNSE.2016.2610838","volume":"3","author":"S Dhamal","year":"2016","unstructured":"Dhamal S, Prabuchandran K, Narahari Y (2016) Information diffusion in social networks in two phases. IEEE Trans Netw Sci Eng 3(4):197\u2013210. https:\/\/doi.org\/10.1109\/TNSE.2016.2610838","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"4884_CR30","doi-asserted-by":"crossref","unstructured":"Salha G, Tziortziotis N, Vazirgiannis M (2018) Adaptive submodular influence maximization with myopic feedback. In: 2018 IEEE\/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 455\u2013462","DOI":"10.1109\/ASONAM.2018.8508254"},{"issue":"1","key":"4884_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TCSS.2020.3032616","volume":"8","author":"G Tong","year":"2020","unstructured":"Tong G, Wang R, Dong Z et al (2020) Time-constrained adaptive influence maximization. IEEE Trans Comput Social Syst 8(1):33\u201344. https:\/\/doi.org\/10.1109\/TCSS.2020.3032616","journal-title":"IEEE Trans Comput Social Syst"},{"key":"4884_CR32","unstructured":"Peng B, Chen W (2019) Adaptive influence maximization with myopic feedback. In: Wallach H, Larochelle H, Beygelzimer A, et\u00a0al. (eds) Advances In Neural Information Processing Systems 32 (NIPS 2019), pp 5574\u20135583"},{"issue":"4","key":"4884_CR33","doi-asserted-by":"publisher","first-page":"7","DOI":"10.9781\/ijimai.2021.12.004","volume":"7","author":"D Medel","year":"2022","unstructured":"Medel D, Gonzalez-Gonzalez C, Aciar SV (2022) Social relations and methods in recommender systems: A systematic review. Int J Interact Multimedia Artif Intell 7(4):7\u201317. https:\/\/doi.org\/10.9781\/ijimai.2021.12.004","journal-title":"Int J Interact Multimedia Artif Intell"},{"key":"4884_CR34","doi-asserted-by":"crossref","unstructured":"Yuan J, Tang S (2016) No time to observe: Adaptive influence maximization with partial feedback. In: Proceedings of the twenty-sixth international joint conference on artificial intelligence (IJCAI-17), pp 3908\u20133914","DOI":"10.24963\/ijcai.2017\/546"},{"key":"4884_CR35","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.eswa.2018.04.016","volume":"107","author":"A Sela","year":"2018","unstructured":"Sela A, Goldenberg D, Ben-Gal I et al (2018) Active viral marketing: Incorporating continuous active seeding efforts into the diffusion model. Expert Syst Appl 107:45\u201360. https:\/\/doi.org\/10.1016\/j.eswa.2018.04.016","journal-title":"Expert Syst Appl"},{"key":"4884_CR36","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.omega.2017.06.002","volume":"77","author":"M Samadi","year":"2018","unstructured":"Samadi M, Nagi R, Semenov A et al (2018) Seed activation scheduling for influence maximization in social networks. Omega 77:96\u2013114. https:\/\/doi.org\/10.1016\/j.omega.2017.06.002","journal-title":"Omega"},{"issue":"1","key":"4884_CR37","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.orl.2019.10.013","volume":"48","author":"S Tang","year":"2020","unstructured":"Tang S, Yuan J (2020) Influence maximization with partial feedback. Oper Res Lett 48(1):24\u201328. https:\/\/doi.org\/10.1016\/j.orl.2019.10.013","journal-title":"Oper Res Lett"},{"issue":"1","key":"4884_CR38","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TETC.2020.3031057","volume":"10","author":"G Tong","year":"2022","unstructured":"Tong G, Wang R (2022) On adaptive influence maximization under general feedback models. IEEE Trans Emerg Topics Comput 10(1):463\u2013475. https:\/\/doi.org\/10.1109\/TETC.2020.3031057","journal-title":"IEEE Trans Emerg Topics Comput"},{"key":"4884_CR39","doi-asserted-by":"publisher","unstructured":"Wang C, Shi Q, Xian W et al (2021) Efficient diversified influence maximization with adaptive policies. Knowl Based Syst 213. https:\/\/doi.org\/10.1016\/j.knosys.2020.106692","DOI":"10.1016\/j.knosys.2020.106692"},{"issue":"2","key":"4884_CR40","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1109\/TCSS.2021.3109043","volume":"9","author":"T Lev","year":"2022","unstructured":"Lev T, Ben-Gal I, Shmueli E (2022) Influence maximization through scheduled seeding in a real-world setting. IEEE Trans Comput Social Syst 9(2):494\u2013507. https:\/\/doi.org\/10.1109\/TCSS.2021.3109043","journal-title":"IEEE Trans Comput Social Syst"},{"issue":"2","key":"4884_CR41","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TKDE.2014.2330833","volume":"27","author":"JR Lee","year":"2015","unstructured":"Lee JR, Chung CW (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":"4884_CR42","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","volume":"278","author":"Z Tian","year":"2014","unstructured":"Tian Z, Bai W, Bin W et al (2014) Maximizing the spread of influence ranking in social networks. Inf Sci 278:535\u2013544. https:\/\/doi.org\/10.1016\/j.ins.2014.03.070","journal-title":"Inf Sci"},{"issue":"1","key":"4884_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep05547","volume":"4","author":"S Pei","year":"2014","unstructured":"Pei S, Muchnik L, Andrade JS Jr et al (2014) Searching for superspreaders of information in real-world social media. Sci Reports 4(1):1\u201312. https:\/\/doi.org\/10.1038\/srep05547","journal-title":"Sci Reports"},{"key":"4884_CR44","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","volume":"160","author":"J Tang","year":"2018","unstructured":"Tang J, Zhang R, Yao Y et al (2018) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl Based Syst 160:88\u2013103. https:\/\/doi.org\/10.1016\/j.knosys.2018.06.013","journal-title":"Knowl Based Syst"},{"key":"4884_CR45","doi-asserted-by":"publisher","unstructured":"Olivares R, Mu\u00f1oz F, Riquelme F (2021) A multi-objective linear threshold influence spread model solved by swarm intelligence-based methods. Knowl Based Syst 212. https:\/\/doi.org\/10.1016\/j.knosys.2020.106623","DOI":"10.1016\/j.knosys.2020.106623"},{"key":"4884_CR46","doi-asserted-by":"publisher","unstructured":"Biswas TK, Abbasi A, Chakrabortty RK (2021) An mcdm integrated adaptive simulated annealing approach for influence maximization in social networks. Inf Sci 556:27\u201348. https:\/\/doi.org\/10.1109\/MCI.2016.2572538","DOI":"10.1109\/MCI.2016.2572538"},{"key":"4884_CR47","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No. 98TH8360), IEEE, pp 69\u201373","DOI":"10.1109\/ICEC.1998.699146"},{"key":"4884_CR48","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.neucom.2022.02.034","volume":"489","author":"Y Wang","year":"2022","unstructured":"Wang Y, He Y, Zhu Z (2022) Study on fast speed fractional order gradient descent method and its application in neural networks. Neurocomputing 489:366\u2013376. https:\/\/doi.org\/10.1016\/j.neucom.2022.02.034","journal-title":"Neurocomputing"},{"key":"4884_CR49","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ins.2021.11.076","volume":"586","author":"Z Meng","year":"2022","unstructured":"Meng Z, Zhong Y, Mao G et al (2022) Pso-sono: A novel pso variant for single-objective numerical optimization. Inf Sci 586:176\u2013191. https:\/\/doi.org\/10.1016\/j.ins.2021.11.076","journal-title":"Inf Sci"},{"key":"4884_CR50","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.neucom.2022.05.048","volume":"501","author":"X Li","year":"2022","unstructured":"Li X, Ren J (2022) Micq-ipso: An effective two-stage hybrid feature selection algorithm for high-dimensional data. Neurocomputing 501:328\u2013342. https:\/\/doi.org\/10.1016\/j.neucom.2022.05.048","journal-title":"Neurocomputing"},{"key":"4884_CR51","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 et al (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"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04884-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04884-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04884-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T14:14:36Z","timestamp":1698070476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04884-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,3]]},"references-count":51,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["4884"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04884-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2023,8,3]]},"assertion":[{"value":"10 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}