Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention

Online misinformation has been considered as one of the top global risks as it may cause serious consequences such as economic damages and public panic. The misinformation prevention problem aims at generating a positive cascade with appropriate seed nodes in order to compete against the misinformation. In this paper, we study the misinformation prevention problem under the prominent independent cascade model. Due to the #{P}-hardness in computing influence, the core problem is to design effective sampling methods to estimate the function value. The main contribution of this paper is a novel sampling method. Different from the classic reverse sampling technique which treats all nodes equally and samples the node uniformly, the proposed method proceeds with a hybrid sampling process which is able to attach high weights to the users who are prone to be affected by the misinformation. Consequently, the new sampling method is more powerful in generating effective samples used for computing seed nodes for the positive cascade. Based on the new hybrid sample technique, we design an algorithm offering a $(1-1/e-\epsilon)-$ approximation. We experimentally evaluate the proposed method on extensive datasets and show that it significantly outperforms the state-of-the-art solutions.

[1]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

[2]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[3]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[4]  Donghyun Kim,et al.  Rumor restriction in Online Social Networks , 2013, 2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC).

[5]  Alex Thomo,et al.  Reverse Prevention Sampling for Misinformation Mitigation in Social Networks , 2020, ICDT.

[6]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[7]  Zhenfu Cao,et al.  Sybil-aware least cost rumor blocking in social networks , 2014, 2014 IEEE Global Communications Conference.

[8]  Weili Wu,et al.  Distributed Rumor Blocking With Multiple Positive Cascades , 2017, IEEE Transactions on Computational Social Systems.

[9]  Divyakant Agrawal,et al.  Limiting the spread of misinformation in social networks , 2011, WWW.

[10]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[11]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[12]  My T. Thai,et al.  Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks , 2016, SIGMOD Conference.

[13]  Deying Li,et al.  An efficient randomized algorithm for rumor blocking in online social networks , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[14]  Weili Wu,et al.  On Misinformation Containment in Online Social Networks , 2018, NeurIPS.

[15]  Weili Wu,et al.  Least Cost Rumor Blocking in Social Networks , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[16]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[17]  Alex Thomo,et al.  Scalable Misinformation Prevention in Social Networks , 2018, ArXiv.

[18]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[19]  Richard M. Karp,et al.  An Optimal Algorithm for Monte Carlo Estimation , 2000, SIAM J. Comput..

[20]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[21]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.