Misinformation mitigation under differential propagation rates and temporal penalties

Author:

Simpson Michael1,Hashemi Farnoosh1,Lakshmanan Laks V. S.1

Affiliation:

1. University of British Columbia, Vancouver, Canada

Abstract

We propose an information propagation model that captures important temporal aspects that have been well observed in the dynamics of fake news diffusion, in contrast with the diffusion of truth. The model accounts for differential propagation rates of truth and misinformation and for user reaction times. We study a time-sensitive variant of the misinformation mitigation problem, where k seeds are to be selected to activate a truth campaign so as to minimize the number of users that adopt misinformation propagating through a social network. We show that the resulting objective is non-submodular and employ a sandwiching technique by defining submodular upper and lower bounding functions, providing data-dependent guarantees. In order to enable the use of a reverse sampling framework, we introduce a weighted version of reverse reachability sets that captures the associated differential propagation rates and establish a key equivalence between weighted set coverage probabilities and mitigation with respect to the sandwiching functions. Further, we propose an offline reverse sampling framework that provides (1 - 1/ e - ϵ)-approximate solutions to our bounding functions and introduce an importance sampling technique to reduce the sample complexity of our solution. Finally, we show how our framework can provide an anytime solution to the problem. Experiments over five datasets show that our approach outperforms previous approaches and is robust to uncertainty in the model parameters.

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Reference52 articles.

1. Maximizing product adoption in social networks

2. Shishir Bharathi , David Kempe , and Mahyar Salek . 2007. Competitive influence maximization in social networks . In WINE'07 (San Diego, CA, USA) . Springer-Verlag , Berlin, Heidelberg , 306--311. http://dl.acm.org/citation.cfm?id=178 1894 .1781932 Shishir Bharathi, David Kempe, and Mahyar Salek. 2007. Competitive influence maximization in social networks. In WINE'07 (San Diego, CA, USA). Springer-Verlag, Berlin, Heidelberg, 306--311. http://dl.acm.org/citation.cfm?id=1781894.1781932

3. C. Budak D. Agrawal and A. El Abbadi. 2011. Limiting the spread of misinformation in social networks. In WWW'11. C. Budak D. Agrawal and A. El Abbadi. 2011. Limiting the spread of misinformation in social networks. In WWW'11.

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. CONTAIN: A community-based algorithm for network immunization;Engineering Science and Technology, an International Journal;2024-07

2. Efficient Influence Minimization via Node Blocking;Proceedings of the VLDB Endowment;2024-06

3. A majority-based learning system for detecting misinformation;Behaviour & Information Technology;2024-03-06

4. Host Profit Maximization: Leveraging Performance Incentives and User Flexibility;Proceedings of the VLDB Endowment;2023-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3