A Multi-Feature Diffusion Model: Rumor Blocking in Social Networks

Online social networks provide a convenient platform for the spread of rumors, which could lead to serious aftermaths such as economic losses and public panic. The classical rumor blocking problem aims to launch a set of nodes as a positive cascade to compete with misinformation in order to limit the spread of rumors. However, most of the related researches were based on a one-dimensional diffusion model. In reality, there is more than one feature associated with an object. A user’s impression on this object is determined not just by one feature but by her overall evaluation of all features associated with it. Thus, the influence spread of this object can be decomposed into the spread of multiple features. Based on that, we design a multi-feature diffusion model (MF-model) in this paper and formulate a multi-feature rumor blocking (MFRB) problem on a multi-layer network structure according to this model. To solve the MFRB problem, we design a creative sampling method called Multi-Sampling, which can be applied to this multi-layer network structure. Then, we propose a Revised-IMM algorithm and obtain a satisfactory approximate solution to MFRB. Finally, we evaluate our proposed algorithm by conducting experiments on real datasets, which shows the effectiveness of our Revised-IMM and its advantage to their baseline algorithms.

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

[2]  Yifei Yuan,et al.  Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate , 2011, SDM.

[3]  My T. Thai,et al.  A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing , 2017, IEEE/ACM Transactions on Networking.

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

[5]  Jinwoo Shin,et al.  On Maximizing Diffusion Speed Over Social Networks With Strategic Users , 2016, IEEE/ACM Transactions on Networking.

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

[7]  Masahiro Kimura,et al.  Minimizing the Spread of Contamination by Blocking Links in a Network , 2008, AAAI.

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

[9]  Le Song,et al.  Scalable diffusion-aware optimization of network topology , 2014, KDD.

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

[11]  Chuang Ma,et al.  Identifying influential spreaders in complex networks based on gravity formula , 2015, ArXiv.

[12]  M. Gentzkow,et al.  Social Media and Fake News in the 2016 Election , 2017 .

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

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

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

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

[17]  Xiang Li,et al.  TipTop: (Almost) Exact Solutions for Influence Maximization in Billion-Scale Networks , 2017, IEEE/ACM Transactions on Networking.

[18]  Weili Wu,et al.  Targeted Protection Maximization in Social Networks , 2020, IEEE Transactions on Network Science and Engineering.

[19]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

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

[21]  Huiyuan Zhang,et al.  Recent Advances in Information Diffusion and Influence Maximization of Complex Social Networks , 2014 .

[22]  Laks V. S. Lakshmanan,et al.  From Competition to Complementarity: Comparative Influence Diffusion and Maximization , 2015, Proc. VLDB Endow..

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

[24]  Laks V. S. Lakshmanan,et al.  CELF++: optimizing the greedy algorithm for influence maximization in social networks , 2011, WWW.

[25]  Michalis Faloutsos,et al.  Gelling, and melting, large graphs by edge manipulation , 2012, CIKM.

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

[27]  Fan Chung Graham,et al.  Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..

[28]  Ding-Zhu Du,et al.  Minimizing Misinformation Profit in Social Networks , 2019, IEEE Transactions on Computational Social Systems.

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

[30]  Kyomin Jung,et al.  IRIE: A Scalable Influence Maximization Algorithm for Independent Cascade Model and Its Extensions , 2011, ArXiv.

[31]  Weili Wu,et al.  Influence Maximization , 2020, ACM Trans. Knowl. Discov. Data.

[32]  Wei Chen,et al.  An Issue in the Martingale Analysis of the Influence Maximization Algorithm IMM , 2018, CSoNet.

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

[34]  Zhoujun Li,et al.  Negative Influence Minimizing by Blocking Nodes in Social Networks , 2013, AAAI.

[35]  Ding-Zhu Du,et al.  Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

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

[37]  Neil Shah,et al.  False Information on Web and Social Media: A Survey , 2018, ArXiv.

[38]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[39]  Weili Wu,et al.  Maximizing rumor containment in social networks with constrained time , 2014, Social Network Analysis and Mining.

[40]  Kyomin Jung,et al.  IRIE: Scalable and Robust Influence Maximization in Social Networks , 2011, 2012 IEEE 12th International Conference on Data Mining.

[41]  Weili Wu,et al.  A Novel Scene of Viral Marketing for Complementary Products , 2019, IEEE Transactions on Computational Social Systems.