{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T18:30:36Z","timestamp":1775932236636,"version":"3.50.1"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T00:00:00Z","timestamp":1736553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2021YFC3300300"],"award-info":[{"award-number":["2021YFC3300300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62202089, 72192832, and 72371148"],"award-info":[{"award-number":["62202089, 72192832, and 72371148"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100013105","name":"Shanghai Rising-Star Program","doi-asserted-by":"crossref","award":["23QA1403100"],"award-info":[{"award-number":["23QA1403100"]}],"id":[{"id":"10.13039\/501100013105","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["N2319004"],"award-info":[{"award-number":["N2319004"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2025,2,28]]},"abstract":"<jats:p>Rumor suppression is targeted at diminishing the impact of false and negative information within social networks by decreasing the prevalence of belief in such rumors among individuals, utilizing diverse strategies. Previous studies have broadly delineated rumor suppression strategies into two primary categories: targeting key nodes or edges for obstruction, and enlisting high-influence nodes to disseminate truth-related accurate information. Traditionally, employing a singular strategy involves utilizing a static algorithm throughout the rumor suppression endeavor. This method, however, encounters difficulties in adapting to fluctuating external conditions, rendering it less efficacious in the management of rumor proliferation. In response to these challenges, we introduce the concept of Adaptive Rumor Suppression (ARS), which aims to dynamically counter rumors by taking into account the nuances of propagation dynamics and the surrounding environmental context. We propose a multi-label state transition linear threshold model to more closely mirror the complex process of information diffusion across social networks. Furthermore, we advocate for a multi-round hybrid strategy that amalgamates blocking and clarification tactics to address the ARS problem within the confines of limited resource allocations. To navigate the complexities of ARS, we introduce the Hybrid Strategy of Each Round (HS-R) algorithm, which synergizes multiple strategies to effectively counter the spread of rumors. In extension, we present the Multi-Round Multi-Label (MRML) algorithm, designed to augment the efficiency of the HS-R algorithm. Experimental evaluations conducted on authentic social network datasets illustrate that our methodologies significantly outshine baseline algorithms, offering a more effective and adaptable solution to curb rumor propagation across varied environments.<\/jats:p>","DOI":"10.1145\/3701738","type":"journal-article","created":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T05:55:52Z","timestamp":1730440552000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Adaptive Rumor Suppression on Social Networks: A Multi-Round Hybrid Approach"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1820-6141","authenticated-orcid":false,"given":"Qiang","family":"He","sequence":"first","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6185-6864","authenticated-orcid":false,"given":"Zelin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8736-0588","authenticated-orcid":false,"given":"Tingting","family":"Bi","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9788-6634","authenticated-orcid":false,"given":"Hui","family":"Fang","sequence":"additional","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5149-6024","authenticated-orcid":false,"given":"Xiushuang","family":"Yi","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5735-2507","authenticated-orcid":false,"given":"Keping","family":"Yu","sequence":"additional","affiliation":[{"name":"Hosei University, Chiyoda-ku, Japan"}]}],"member":"320","published-online":{"date-parts":[[2025,1,11]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"2020. 2020 Presidential Election Results. Retrieved June 29 2023 from https:\/\/www.cnn.com\/election\/2020\/results\/president"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"e_1_3_1_4_2","first-page":"1","article-title":"Immune Algorithm to Suppress Rumor Propagation Based on Influence Maximization","author":"Chen Jing","year":"2022","unstructured":"Jing Chen, Nana Wei, and Hongbo Yang. 2022. Immune Algorithm to Suppress Rumor Propagation Based on Influence Maximization. Security and Communication Networks 2022 (Apr. 2022), 1\u201313.","journal-title":"Security and Communication Networks"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3441447"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2019.2963418"},{"key":"e_1_3_1_7_2","first-page":"1","article-title":"RBOTUE: Rumor Blocking Considering Outbreak Threshold and User Experience","volume":"71","author":"Ding Xuejun","year":"2021","unstructured":"Xuejun Ding, Mengyu Li, Yong Tian, and Man Jiang. 2021. RBOTUE: Rumor Blocking Considering Outbreak Threshold and User Experience. IEEE Transactions on Engineering Management 71 (2021), 1\u201319.","journal-title":"IEEE Transactions on Engineering Management"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.05.044"},{"key":"e_1_3_1_9_2","first-page":"47","article-title":"Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization","volume":"42","author":"Golovin Daniel","year":"2010","unstructured":"Daniel Golovin and Andreas Krause. 2010. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. Journal of Artificial Intelligence Research 42 (2010), 47.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2022.3204751"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3032893"},{"key":"e_1_3_1_12_2","first-page":"350","article-title":"Dynamic Opinion Maximization in Social Networks","volume":"35","author":"He Qiang","year":"2023","unstructured":"Qiang He, Hui Fang, Jie Zhang, and Xingwei Wang. 2023. Dynamic Opinion Maximization in Social Networks. IEEE Transactions on Knowledge and Data Engineering 35 (2023), 350\u2013361.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.02.056"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2585591"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2966593"},{"key":"e_1_3_1_16_2","first-page":"619","article-title":"DARIM: Dynamic Approach for Rumor Influence Minimization in Online Social Networks","author":"Hosni Adil Imad Eddine","year":"2019","unstructured":"Adil Imad Eddine Hosni, Kan Li, and Sadique Ahmad. 2019. DARIM: Dynamic Approach for Rumor Influence Minimization in Online Social Networks. Neural Information Processing, 619\u2013630.","journal-title":"Neural Information Processing"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00121"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543546"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3059430"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00050"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/211542.606546"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.04.002"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3578936"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3057082"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2989140"},{"key":"e_1_3_1_29_2","unstructured":"Benedek Rozemberczki Carl Allen and Rik Sarkar. 2021. Multi-Scale Attributed Node Embedding. arxiv:1909.13021. Retrieved from https:\/\/arxiv.org\/abs\/1909.13021"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00048"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00135"},{"key":"e_1_3_1_32_2","first-page":"20","article-title":"Multi-Round Influence Maximization","author":"Sun Lichao","year":"2018","unstructured":"Lichao Sun, Weiran Huang, Philip S. Yu, and Wei Chen. 2018. Multi-Round Influence Maximization. Social and Information Networks (May 2018), 20.","journal-title":"Social and Information Networks"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00011"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2783190"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2563397"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2976972"},{"key":"e_1_3_1_38_2","first-page":"134","volume-title":"Proceedings of the Workshops at the 27th AAAI Conference on Artificial Intelligence","author":"Wang Senzhang","year":"2013","unstructured":"Senzhang Wang, Xiaojian Zhao, Yan Chen, Zhoujun Li, Kai Zhang, and Jiali Xia. 2013. Negative Influence Minimizing by Blocking Nodes in Social Networks. In Proceedings of the Workshops at the 27th AAAI Conference on Artificial Intelligence, 134\u2013136."},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.2295802"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.2297115"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0122-7"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.05.004"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00066"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2903272"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3441455"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3301302"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.055"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2021.10.041"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103094"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701738","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:57:16Z","timestamp":1750298236000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,11]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2,28]]}},"alternative-id":["10.1145\/3701738"],"URL":"https:\/\/doi.org\/10.1145\/3701738","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,11]]},"assertion":[{"value":"2024-04-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}