Analysis of misinformation containment in online social networks

With their blistering expansion in recent years, popular online social sites such as Twitter, Facebook and Bebo, have become not only one of the most effective channels for viral marketing but also the major news sources for many people nowadays. Alongside these promising features, however, comes the threat of misinformation propagation which can lead to undesirable effects. Due to the sheer number of online social network (OSN) users and the highly clustered structures commonly shared by these kinds of networks, there is a substantial challenge to efficiently contain viral spread of misinformation in large-scale social networks. In this paper, we focus on how to limit viral propagation of misinformation in OSNs. Particularly, we study a set of problems, namely the @b"T^I-Node Protectors problems, which aim to find the smallest set of highly influential nodes from which disseminating good information helps to contain the viral spread of misinformation, initiated from a set of nodes I, within a desired fraction (1-@b) of the nodes in the entire network in T time steps. For this family of problems, we analyze and present solutions including their inapproximability results, greedy algorithms that provide better lower bounds on the number of selected nodes, and a community-based method for solving these problems. We further conduct a number of experiments on real-world traces, and the empirical results show that our proposed methods outperform existing alternative approaches in finding those important nodes that can help to contain the spread of misinformation effectively.

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

[2]  My T. Thai,et al.  Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? , 2012, HT '12.

[3]  Andrea Lancichinetti,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[4]  David M. Nicol,et al.  Models and Analysis of Active Worm Defense , 2005, MMM-ACNS.

[5]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[6]  Wei Xu,et al.  Toward worm detection in online social networks , 2010, ACSAC '10.

[7]  Ning Chen,et al.  On the approximability of influence in social networks , 2008, SODA '08.

[8]  Santo Fortunato,et al.  Community detection algorithms: a comparative analysis: invited presentation, extended abstract , 2009, VALUETOOLS.

[9]  Nam P. Nguyen,et al.  Overlapping communities in dynamic networks: their detection and mobile applications , 2011, MobiCom.

[10]  Shishir Bharathi,et al.  Competitive Influence Maximization in Social Networks , 2007, WINE.

[11]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[12]  Guanhua Yan,et al.  Malware propagation in online social networks: nature, dynamics, and defense implications , 2011, ASIACCS '11.

[13]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[14]  Ying Xuan,et al.  Towards social-aware routing in dynamic communication networks , 2009, 2009 IEEE 28th International Performance Computing and Communications Conference.

[15]  Ahmed Helmy,et al.  Encounter-based worms: analysis and defense , 2006, 2006 2nd IEEE Workshop on Wireless Mesh Networks.

[16]  Laks V. S. Lakshmanan,et al.  On minimizing budget and time in influence propagation over social networks , 2012, Social Network Analysis and Mining.

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

[18]  Pradeep Dubey,et al.  Competing for Customers in a Social Network: The Quasi-linear Case , 2006, WINE.

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

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

[21]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[22]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

[23]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[24]  Masahiro Kimura,et al.  Extracting Influential Nodes for Information Diffusion on a Social Network , 2007, AAAI.

[25]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[26]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[27]  Nam P. Nguyen,et al.  Adaptive algorithms for detecting community structure in dynamic social networks , 2011, 2011 Proceedings IEEE INFOCOM.

[28]  Roger Wattenhofer,et al.  Word of Mouth: Rumor Dissemination in Social Networks , 2008, SIROCCO.

[29]  Vern Paxson,et al.  @spam: the underground on 140 characters or less , 2010, CCS '10.