{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:15:45Z","timestamp":1767093345646},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T00:00:00Z","timestamp":1693785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T00:00:00Z","timestamp":1693785600000},"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":["J Supercomput"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11227-023-05601-9","type":"journal-article","created":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T06:02:29Z","timestamp":1693807349000},"page":"3334-3359","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sequential seeding policy on social influence maximization: a Q-learning-driven discrete differential evolution optimization"],"prefix":"10.1007","volume":"80","author":[{"given":"Jianxin","family":"Tang","sequence":"first","affiliation":[]},{"given":"Shihui","family":"Song","sequence":"additional","affiliation":[]},{"given":"Hongyu","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Qian","family":"Du","sequence":"additional","affiliation":[]},{"given":"Jitao","family":"Qu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,4]]},"reference":[{"issue":"100","key":"5601_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.cosrev.2021.100393","volume":"40","author":"M Azaouzi","year":"2021","unstructured":"Azaouzi M, Mnasri W, Romdhane LB (2021) New trends in influence maximization models. Comput Sci Rev 40(100):393. https:\/\/doi.org\/10.1016\/j.cosrev.2021.100393","journal-title":"Comput Sci Rev"},{"key":"5601_CR2","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"5601_CR3","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.peva.2015.06.012","volume":"91","author":"Y Lin","year":"2015","unstructured":"Lin Y, Lui JC (2015) Analyzing competitive influence maximization problems with partial information: an approximation algorithmic framework. Perform Eval 91:187\u2013204. https:\/\/doi.org\/10.1016\/j.peva.2015.06.012","journal-title":"Perform Eval"},{"key":"5601_CR4","doi-asserted-by":"publisher","unstructured":"Lu W, Chen W, Lakshmanan LV (2015) From competition to complementarity: comparative influence diffusion and maximization. arXiv preprint arXiv:1507.00317https:\/\/doi.org\/10.48550\/arXiv.1507.00317","DOI":"10.48550\/arXiv.1507.00317"},{"key":"5601_CR5","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2021.3084468","author":"J Guo","year":"2021","unstructured":"Guo J, Zhang Y, Wu W (2021) An overall evaluation on benefits of competitive influence diffusion. IEEE Trans Big Data. https:\/\/doi.org\/10.1109\/TBDATA.2021.3084468","journal-title":"IEEE Trans Big Data"},{"key":"5601_CR6","unstructured":"Tong A, Du DZ, Wu W (2018) On misinformation containment in online social networks. Adv Neural Inform Process Syst, 341\u2013351"},{"issue":"1","key":"5601_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2021.02.014","volume":"861","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Yang W, Du DZ (2021) Rumor correction maximization problem in social networks. Theoret Comput Sci 861(1):102\u2013116. https:\/\/doi.org\/10.1016\/j.tcs.2021.02.014","journal-title":"Theoret Comput Sci"},{"issue":"9","key":"5601_CR8","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.1109\/TKDE.2016.2569096","volume":"28","author":"Z Zhou","year":"2016","unstructured":"Zhou Z, Lu H, Deng C et al (2016) User preference learning for online social recommendation. IEEE Trans Knowl Data Eng 28(9):2522\u20132534. https:\/\/doi.org\/10.1109\/TKDE.2016.2569096","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"5601_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-018-32081-2","volume":"8","author":"J Jankowski","year":"2018","unstructured":"Jankowski J, Szymanski BK, Kazienko P et al (2018) Probing limits of information spread with sequential seeding. Sci Rep 8(1):1\u20139. https:\/\/doi.org\/10.1038\/s41598-018-32081-2","journal-title":"Sci Rep"},{"issue":"1","key":"5601_CR10","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 Rep 7(1):1\u201311. https:\/\/doi.org\/10.1038\/s41598-017-00937-8","journal-title":"Sci Rep"},{"key":"5601_CR11","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.asoc.2016.04.025","volume":"56","author":"Y Ni","year":"2017","unstructured":"Ni Y (2017) Seeding strategies for viral marketing: an empirical comparison. Appl Soft Comput 56:730\u2013737. https:\/\/doi.org\/10.1016\/j.asoc.2016.04.025","journal-title":"Appl Soft Comput"},{"issue":"9","key":"5601_CR12","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0024306","volume":"6","author":"J Zhao","year":"2011","unstructured":"Zhao J, Yang TH, Huang Y et al (2011) Ranking candidate disease genes from gene expression and protein interaction: a katz-centrality based approach. PLoS ONE 6(9):e24,306. https:\/\/doi.org\/10.1371\/journal.pone.0024306","journal-title":"PLoS ONE"},{"key":"5601_CR13","doi-asserted-by":"crossref","unstructured":"Hu Q, Gao Y, Ma P, et\u00a0al (2013) A new approach to identify influential spreaders in complex networks. International Conference on Web-Age Information Management, 99\u2013104","DOI":"10.1007\/978-3-642-38562-9_10"},{"key":"5601_CR14","unstructured":"Page L, Brin S, Motwani R et al (1999) The pagerank citation ranking: bringing order to the web. Tech. rep, Stanford InfoLab"},{"key":"5601_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.socnet.2015.08.003","volume":"44","author":"U Brandes","year":"2016","unstructured":"Brandes U, Borgatti SP, Freeman LC (2016) Maintaining the duality of closeness and betweenness centrality. Soc Netw 44:153\u2013159. https:\/\/doi.org\/10.1016\/j.socnet.2015.08.003","journal-title":"Soc Netw"},{"key":"5601_CR16","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":"5601_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, et\u00a0al (2007) Cost-effective outbreak detection in networks. Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"5601_CR18","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, et\u00a0al (2014) Maximizing social influence in nearly optimal time. Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"5601_CR19","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. Proceedings of the 2015 ACM SIGMOD international conference on management of data, 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"5601_CR20","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ins.2018.07.003","volume":"465","author":"YY Ko","year":"2018","unstructured":"Ko YY, Cho KJ, Kim SW (2018) Efficient and effective influence maximization in social networks: a hybrid-approach. Inf Sci 465:44\u2013161. https:\/\/doi.org\/10.1016\/j.ins.2018.07.003","journal-title":"Inf Sci"},{"key":"5601_CR21","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 et al (2020) Three-hop velocity attenuation propagation model for influence maximization in social networks. World Wide Web 23:1261\u20131273. https:\/\/doi.org\/10.1007\/s11280-019-00750-5","journal-title":"World Wide Web"},{"issue":"FEB","key":"5601_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","volume":"103","author":"L Cui","year":"2018","unstructured":"Cui L, Hu H, Yu S et al (2018) Ddse: a novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. J Netw Comput Appl 103(FEB):119\u2013130. https:\/\/doi.org\/10.1016\/j.jnca.2017.12.003","journal-title":"J Netw Comput Appl"},{"issue":"6","key":"5601_CR23","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":"102","key":"5601_CR24","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/j.jnca.2020.102973","volume":"178","author":"L Qiu","year":"2021","unstructured":"Qiu L, Tian X, Zhang J et al (2021) Lidde: A differential evolution algorithm based on local-influence-descending search strategy for influence maximization in social networks. J Netw Comput Appl 178(102):973. https:\/\/doi.org\/10.1016\/j.jnca.2020.102973","journal-title":"J Netw Comput Appl"},{"key":"5601_CR25","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"5601_CR26","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"},{"issue":"4","key":"5601_CR27","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s13278-013-0135-7","volume":"3","author":"P Shakarian","year":"2013","unstructured":"Shakarian P, Eyre S, Paulo D (2013) A scalable heuristic for viral marketing under the tipping model. Soc Netw Anal Min 3(4):1225\u20131248. https:\/\/doi.org\/10.1007\/s13278-013-0135-7","journal-title":"Soc Netw Anal Min"},{"issue":"6144","key":"5601_CR28","doi-asserted-by":"publisher","first-page":"1236,498","DOI":"10.1126\/science.1236498","volume":"341","author":"A Banerjee","year":"2013","unstructured":"Banerjee A, Chandrasekhar AG, Duflo E et al (2013) The diffusion of microfinance. Science 341(6144):1236,498. https:\/\/doi.org\/10.1126\/science.1236498","journal-title":"Science"},{"key":"5601_CR29","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2020.3031057","author":"G Tong","year":"2020","unstructured":"Tong G, Wang R (2020) On adaptive influence maximization under general feedback models. IEEE Trans Emerg Top Comput. https:\/\/doi.org\/10.1109\/TETC.2020.3031057","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"5601_CR30","doi-asserted-by":"publisher","first-page":"151,208","DOI":"10.1109\/ACCESS.2020.3016913","volume":"8","author":"R Michalski","year":"2020","unstructured":"Michalski R, Jankowski J, Br\u00f3dka P (2020) Effective influence spreading in temporal networks with sequential seeding. IEEE Access 8:151,208-151,218. https:\/\/doi.org\/10.1109\/ACCESS.2020.3016913","journal-title":"IEEE Access"},{"issue":"123","key":"5601_CR31","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1016\/j.physa.2019.123659","volume":"545","author":"C Ni","year":"2020","unstructured":"Ni C, Yang J, Kong D (2020) Sequential seeding strategy for social influence diffusion with improved entropy-based centrality. Physica A 545(123):659. https:\/\/doi.org\/10.1016\/j.physa.2019.123659","journal-title":"Physica A"},{"issue":"3","key":"5601_CR32","doi-asserted-by":"publisher","first-page":"033,130","DOI":"10.1063\/5.0023427","volume":"31","author":"P Br\u00f3dka","year":"2021","unstructured":"Br\u00f3dka P, Jankowski J, Michalski R (2021) Sequential seeding in multilayer networks. Chaos: An Interdisciplin J Nonlinear Sci 31(3):033,130. https:\/\/doi.org\/10.1063\/5.0023427","journal-title":"Chaos: An Interdisciplin J Nonlinear Sci"},{"key":"5601_CR33","doi-asserted-by":"crossref","unstructured":"Seeman L, Singer Y (2013) Adaptive seeding in social networks. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 459\u2013468","DOI":"10.1109\/FOCS.2013.56"},{"issue":"1","key":"5601_CR34","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2016","unstructured":"Tong G, Wu W, Tang S et al (2016) 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":"3","key":"5601_CR35","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 Soc Syst 5(3):621\u2013638. https:\/\/doi.org\/10.1109\/TCSS.2018.2852742","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"99","key":"5601_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCSS.2021.3109043","volume":"PP","author":"T Lev","year":"2021","unstructured":"Lev T, Ben-Gal I, Shmueli E (2021) Influence maximization through scheduled seeding in a real-world setting. IEEE Trans Comput Soc Syst PP(99):1\u201314. https:\/\/doi.org\/10.1109\/TCSS.2021.3109043","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"1","key":"5601_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":"5601_CR38","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 Soc Syst 8(1):33\u201344. https:\/\/doi.org\/10.1109\/TCSS.2020.3032616","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"5601_CR39","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 Artificial Intell Res 42:427\u2013486. https:\/\/doi.org\/10.1613\/jair.3278","journal-title":"J Artificial Intell Res"},{"key":"5601_CR40","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","volume":"278","author":"T Zhu","year":"2014","unstructured":"Zhu T, Wang B, Wu B 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"},{"key":"5601_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.06.007","volume":"650","author":"L L\u00fc","year":"2016","unstructured":"L\u00fc L, Chen D, Ren XL et al (2016) Vital nodes identification in complex networks. Phys Rep 650:1\u201363. https:\/\/doi.org\/10.1016\/j.physrep.2016.06.007","journal-title":"Phys Rep"},{"issue":"103","key":"5601_CR42","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.engappai.2020.103479","volume":"90","author":"M Pant","year":"2020","unstructured":"Pant M, Zaheer H, Garcia-Hernandez L et al (2020) Differential evolution: a review of more than two decades of research. Eng Appl Artif Intell 90(103):479. https:\/\/doi.org\/10.1016\/j.engappai.2020.103479","journal-title":"Eng Appl Artif Intell"},{"key":"5601_CR43","unstructured":"Leskovec J, Krevl A, Datasets S (2011) Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data\/"},{"key":"5601_CR44","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":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05601-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05601-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05601-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T11:05:52Z","timestamp":1705921552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05601-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,4]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["5601"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05601-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,4]]},"assertion":[{"value":"17 August 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 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":"This article does not contain any studies with animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this paper.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Jianxin Tang was involved in conceptualization, supervision, project administration, funding acquisition, and writing\u2014review and editing. Shihui Song was involved in methodology, software, validation, and writing\u2014original draft. Hongyu Zhu contributed to resources and software. Qian Du was involved in data curation and visualization. Jitao Qu was involved in formal analysis and writing\u2014review and editing. All authors reviewed the manuscript.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Authors\u2019 contributions"}},{"value":"This work was not supported by any organization.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}}]}}