{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:25:52Z","timestamp":1772907952296,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902324"],"award-info":[{"award-number":["61902324"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11426179"],"award-info":[{"award-number":["11426179"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872298"],"award-info":[{"award-number":["61872298"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10489-023-04555-y","type":"journal-article","created":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T13:13:20Z","timestamp":1680614000000},"page":"20293-20310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Deep reinforcement learning-based approach for rumor influence minimization in social networks"],"prefix":"10.1007","volume":"53","author":[{"given":"Jiajian","family":"Jiang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8201-9631","authenticated-orcid":false,"given":"Xiaoliang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zexia","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Xianyong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yajun","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,4]]},"reference":[{"issue":"6380","key":"4555_CR1","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1126\/science.aap9559","volume":"359","author":"S Vosoughi","year":"2018","unstructured":"Vosoughi S, Roy D, Aral S (2018) The spread of true and false news online. Science 359 (6380):1146\u20131151. https:\/\/doi.org\/10.1126\/science.aap9559","journal-title":"Science"},{"key":"4555_CR2","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.ins.2021.05.085","volume":"574","author":"Z Dang","year":"2021","unstructured":"Dang Z, Li L, Ni W, Liu R P, Peng H, Yang Y (2021) How does rumor spreading affect people inside and outside an institution. Inf Sci 574:377\u2013393. https:\/\/doi.org\/10.1016\/j.ins.2021.05.085","journal-title":"Inf Sci"},{"issue":"1","key":"4555_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13054-020-03140-w","volume":"24","author":"H Hassanian-Moghaddam","year":"2020","unstructured":"Hassanian-Moghaddam H, Zamani N, Kolahi A -A, McDonald R, Hovda K E (2020) Double trouble: methanol outbreak in the wake of the covid-19 pandemic in Iran\u2014a cross-sectional assessment. Crit Care 24(1):1\u20133","journal-title":"Crit Care"},{"key":"4555_CR4","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1038\/scientificamerican0217-24","volume":"316","author":"D Pogue","year":"2017","unstructured":"Pogue D (2017) How to stamp out fake news. Sci Am 316:24\u201324. https:\/\/doi.org\/10.1038\/scientificamerican0217-24","journal-title":"Sci Am"},{"key":"4555_CR5","doi-asserted-by":"publisher","unstructured":"Fan L, Lu Z, Wu W, Thuraisingham B M, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: ICDCS, pp 540\u2013549. https:\/\/doi.org\/10.1109\/ICDCS.2013.34","DOI":"10.1109\/ICDCS.2013.34"},{"issue":"10","key":"4555_CR6","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/TKDE.2017.2728064","volume":"29","author":"B Wang","year":"2017","unstructured":"Wang B, Chen G, Fu L, Song L, Wang X (2017) DRIMUX: dynamic rumor influence minimization with user experience in social networks. IEEE Trans Knowl Data Eng 29(10):2168\u20132181. https:\/\/doi.org\/10.1109\/TKDE.2017.2728064","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"4555_CR7","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/TNSE.2019.2903272","volume":"7","author":"R Yan","year":"2020","unstructured":"Yan R, Li D, Wu W, Du D, Wang Y (2020) Minimizing influence of rumors by blockers on social networks: algorithms and analysis. IEEE Trans Netw Sci Eng 7(3):1067\u20131078. https:\/\/doi.org\/10.1109\/TNSE.2019.2903272","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"4","key":"4555_CR8","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1007\/s11280-019-00748-z","volume":"23","author":"X Wang","year":"2020","unstructured":"Wang X, Deng K, Li J, Yu J X, Jensen C S, Yang X (2020) Efficient targeted influence minimization in big social networks. World Wide Web 23(4):2323\u20132340","journal-title":"World Wide Web"},{"issue":"4","key":"4555_CR9","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1109\/TCSS.2020.2997188","volume":"7","author":"J Zhu","year":"2020","unstructured":"Zhu J, Ni P, Wang G (2020) Activity minimization of misinformation influence in online social networks. IEEE Trans Comput Social Syst 7(4):897\u2013906. https:\/\/doi.org\/10.1109\/TCSS.2020.2997188","journal-title":"IEEE Trans Comput Social Syst"},{"key":"4555_CR10","doi-asserted-by":"publisher","unstructured":"Shi Q, Wang C, Ye D, Chen J, Feng Y, Chen C (2019) Adaptive influence blocking: minimizing the negative spread by observation-based policies. In: 2019 IEEE 35th international conference on data engineering (ICDE), pp 1502\u20131513. https:\/\/doi.org\/10.1109\/ICDE.2019.00135","DOI":"10.1109\/ICDE.2019.00135"},{"issue":"2","key":"4555_CR11","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/TNSE.2017.2783190","volume":"7","author":"G Tong","year":"2020","unstructured":"Tong G, Wu W, Guo L, Li D, Liu C, Liu B, Du D -Z (2020) An efficient randomized algorithm for rumor blocking in online social networks. IEEE Trans Netw Sci Eng 7(2):845\u2013854. https:\/\/doi.org\/10.1109\/TNSE.2017.2783190","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"4555_CR12","unstructured":"Kimura M, Saito K, Motoda H (2008) Minimizing the spread of contamination by blocking links in a network. In: AAAI, pp 1175\u20131180"},{"key":"4555_CR13","doi-asserted-by":"crossref","unstructured":"Jia F, Zhou K, Kamhoua C, Vorobeychik Y (2020) Blocking adversarial influence in social networks. In: Zhu Q, Baras JS, Poovendran R, Chen J (eds) Decision and game theory for security. Springer, pp 257\u2013276","DOI":"10.1007\/978-3-030-64793-3_14"},{"key":"4555_CR14","doi-asserted-by":"publisher","unstructured":"Yan R, Li Y, Wu W, Li D, Wang Y (2019) Rumor blocking through online link deletion on social networks. ACM Trans Knowl Discov Data 13(2). https:\/\/doi.org\/10.1145\/3301302","DOI":"10.1145\/3301302"},{"key":"4555_CR15","doi-asserted-by":"crossref","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","DOI":"10.1137\/1.9781611972825.40"},{"key":"4555_CR16","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1016\/j.ins.2019.10.063","volume":"512","author":"AIE Hosni","year":"2020","unstructured":"Hosni A I E, Li K, Ahmad S (2020) Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors. Inf Sci 512:1458\u20131480. https:\/\/doi.org\/10.1016\/j.ins.2019.10.063","journal-title":"Inf Sci"},{"key":"4555_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.knosys.2019.105452","volume":"105452","author":"AIE Hosni","year":"2020","unstructured":"Hosni A I E, Li K (2020) Minimizing the influence of rumors during breaking news events in online social networks. Knowl Based Syst 105452:193. https:\/\/doi.org\/10.1016\/j.knosys.2019.105452","journal-title":"Knowl Based Syst"},{"key":"4555_CR18","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. KDD \u201901, New York, pp 57\u201366. https:\/\/doi.org\/10.1145\/502512.502525","DOI":"10.1145\/502512.502525"},{"key":"4555_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe D, Kleinberg J M, Tardos \u00c9 (2015) Maximizing the spread of influence through a social network. Theory Comput 11:105\u2013147. https:\/\/doi.org\/10.4086\/toc.2015.v011a004","journal-title":"Theory Comput"},{"issue":"7587","key":"4555_CR20","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver D, Huang A, Maddison C J, Guez A, Sifre L, van den Driessche G, Schrittwieser J, Antonoglou I, Panneershelvam V, Lanctot M, Dieleman S, Grewe D, Nham J, Kalchbrenner N, Sutskever I, Lillicrap T P, Leach M, Kavukcuoglu K, Graepel T, Hassabis D (2016) Mastering the game of go with deep neural networks and tree search. Nat 529(7587):484\u2013489","journal-title":"Nat"},{"issue":"7540","key":"4555_CR21","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu A A, Veness J, Bellemare M G, Graves A, Riedmiller M A, Fidjeland A, Ostrovski G, Petersen S, Beattie C, Sadik A, Antonoglou I, King H, Kumaran D, Wierstra D, Legg S, Hassabis D (2015) Human-level control through deep reinforcement learning. Nat 518(7540):529\u2013533","journal-title":"Nat"},{"issue":"3","key":"4555_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins C J, Dayan P (1992) Q-learning. Mach Learn 8(3):279\u2013292","journal-title":"Mach Learn"},{"key":"4555_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams R J (1992) Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach Learn 8:229\u2013256. https:\/\/doi.org\/10.1007\/BF00992696","journal-title":"Mach Learn"},{"key":"4555_CR24","unstructured":"Silver D, Lever G, Heess N, Degris T, Wierstra D, Riedmiller M A (2014) Deterministic policy gradient algorithms. In: Proceedings of the 31th international conference on machine learning, ICML 2014, Beijing, China, 21\u201326 June 2014. JMLR workshop and conference proceedings, vol 32, pp 387\u2013395"},{"key":"4555_CR25","unstructured":"Lillicrap T P, Hunt J J, Pritzel A, Heess N, Erez T, Tassa Y, Silver D, Wierstra D (2016) Continuous control with deep reinforcement learning. In: Bengio Y, Lecun Y (eds) 4th international conference on learning representations, ICLR 2016, San Juan, Puerto Rico, May 2\u20134, 2016, conference track proceedings"},{"issue":"1","key":"4555_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41019-020-00117-1","volume":"5","author":"S Tian","year":"2020","unstructured":"Tian S, Mo S, Wang L, Peng Z (2020) Deep reinforcement learning-based approach to tackle topic-aware influence maximization. Data Sci Eng 5(1):1\u201311","journal-title":"Data Sci Eng"},{"issue":"4","key":"4555_CR27","doi-asserted-by":"publisher","first-page":"3995","DOI":"10.1007\/s10489-021-02578-x","volume":"52","author":"P Nedunchezhian","year":"2022","unstructured":"Nedunchezhian P, Mahalingam M (2022) Sybilsort algorithm\u2014a friend request decision tracking recommender system in online social networks. Appl Intell 52(4):3995\u20134014. https:\/\/doi.org\/10.1007\/s10489-021-02578-x","journal-title":"Appl Intell"},{"issue":"6","key":"4555_CR28","doi-asserted-by":"publisher","first-page":"6503","DOI":"10.1007\/s10489-021-02729-0","volume":"52","author":"J Yang","year":"2022","unstructured":"Yang J, Wu Y (2022) An approach of bursty event detection in social networks based on topological features. Appl Intell 52(6):6503\u20136521. https:\/\/doi.org\/10.1007\/s10489-021-02729-0","journal-title":"Appl Intell"},{"issue":"8","key":"4555_CR29","doi-asserted-by":"publisher","first-page":"8603","DOI":"10.1007\/s10489-021-02919-w","volume":"52","author":"L Qiu","year":"2022","unstructured":"Qiu L, Sai S, Wei M (2022) BPSL: a new rumor source location algorithm based on the time-stamp back propagation in social networks. Appl Intell 52(8):8603\u20138615. https:\/\/doi.org\/10.1007\/s10489-021-02919-w","journal-title":"Appl Intell"},{"key":"4555_CR30","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.jnca.2018.10.003","volume":"125","author":"V Indu","year":"2019","unstructured":"Indu V, Thampi S M (2019) A nature-inspired approach based on forest fire model for modeling rumor propagation in social networks. J Netw Comput Appl 125:28\u201341. https:\/\/doi.org\/10.1016\/j.jnca.2018.10.003","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"4555_CR31","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1007\/s10489-021-02351-0","volume":"52","author":"NG Swetha","year":"2022","unstructured":"Swetha N G, Karpagam G R (2022) Reinforcement learning infused intelligent framework for semantic web service composition. Appl Intell 52(2):1979\u20132000. https:\/\/doi.org\/10.1007\/s10489-021-02351-0","journal-title":"Appl Intell"},{"issue":"4","key":"4555_CR32","doi-asserted-by":"publisher","first-page":"4715","DOI":"10.1007\/s10489-021-02672-0","volume":"52","author":"L Chen","year":"2022","unstructured":"Chen L, Cui J, Tang X, Qian Y, Li Y, Zhang Y (2022) Rlpath: a knowledge graph link prediction method using reinforcement learning based attentive relation path searching and representation learning. Appl Intell 52(4):4715\u20134726. https:\/\/doi.org\/10.1007\/s10489-021-02672-0","journal-title":"Appl Intell"},{"issue":"11","key":"4555_CR33","doi-asserted-by":"publisher","first-page":"13214","DOI":"10.1007\/s10489-021-03084-w","volume":"52","author":"R Kumar","year":"2022","unstructured":"Kumar R, Amgoth T (2022) Reinforcement learning based connectivity restoration in wireless sensor networks. Appl Intell 52(11):13214\u201313231. https:\/\/doi.org\/10.1007\/s10489-021-03084-w","journal-title":"Appl Intell"},{"key":"4555_CR34","doi-asserted-by":"publisher","unstructured":"Zachary W (1976) An information flow model for conflict and fission in small groups1. J Anthropol Res 33. https:\/\/doi.org\/10.1086\/jar.33.4.3629752","DOI":"10.1086\/jar.33.4.3629752"},{"key":"4555_CR35","unstructured":"McAuley J J, Leskovec J (2012) Learning to discover social circles in ego networks. In: Bartlett P L, Pereira F C N, Burges C J C, Bottou L, Weinberger K Q (eds) Advances in neural information processing systems 25: 26th annual conference on neural information processing systems 2012. Proceedings of a meeting held December 3\u20136, 2012, Lake Tahoe, pp 548\u2013556. https:\/\/proceedings.neurips.cc\/paper\/2012\/hash\/7a614fd06c325499f1680b9896beedeb-Abstract.html"},{"issue":"2","key":"4555_CR36","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"A McCallum","year":"2000","unstructured":"McCallum A, Nigam K, Rennie J, Seymore K (2000) Automating the construction of internet portals with machine learning. Inf Retr 3(2):127\u2013163. https:\/\/doi.org\/10.1023\/A:1009953814988","journal-title":"Inf Retr"},{"issue":"1","key":"4555_CR37","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J M, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1):2. https:\/\/doi.org\/10.1145\/1217299.1217301","journal-title":"ACM Trans Knowl Discov Data"},{"key":"4555_CR38","unstructured":"Smith S L, Kindermans P -J, Le Q V (2018) Don\u2019t decay the learning rate, increase the batch size. In: International conference on learning representations. https:\/\/openreview.net\/forum?id=B1Yy1BxCZ"},{"key":"4555_CR39","unstructured":"Kingma D P, Ba J (2015) Adam: a method for stochastic optimization. In: Bengio Y, Lecun Y (eds) 3rd international conference on learning representations, ICLR 2015, San Diego, CA, USA, May 7\u20139, 2015, Conference Track Proceedings. 1412.6980"},{"issue":"2","key":"4555_CR40","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U Brandes","year":"2008","unstructured":"Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Soc Netw 30(2):136\u2013145","journal-title":"Soc Netw"},{"key":"4555_CR41","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: bringing order to the web. Technical report, Stanford Infolab"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04555-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04555-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-04555-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:02:34Z","timestamp":1744160554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04555-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,4]]},"references-count":41,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["4555"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04555-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,4]]},"assertion":[{"value":"28 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 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 human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval"}},{"value":"The authors have no competing interests to declare that are relevant to the content of the article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}