Boosting Information Spread: An Algorithmic Approach

The majority of influence maximization (IM) studies focus on targeting influential seeders to trigger substantial information spread in social networks. In this paper, we consider a new and complementary problem of how to further increase the influence spread of given seeders. Our study is motivated by the observation that direct incentives could "boost" users so that they are more likely to be influenced by friends. We study the k-boosting problem which aims to find k users to boost so that the final "boosted" influence spread is maximized. The k-boosting problem is different from the IM problem because boosted users behave differently from seeders: boosted users are initially uninfluenced and we only increase their probability to be influenced. Our work also complements the IM studies because we focus on triggering larger influence spread on the basis of given seeders. Both the NP-hardness of the problem and the non-submodularity of the objective function pose challenges to the k-boosting problem. To tackle the problem, we devise two efficient algorithms with the data-dependent approximation ratio. We conduct extensive experiments using real social networks demonstrating the efficiency and effectiveness of our proposed algorithms. We show that boosting solutions returned by our algorithms achieves boosts of influence that are up to several times higher than those achieved by boosting solutions returned by intuitive baselines, which have no guarantee of solution quality. We also explore the "budget allocation" problem in our experiments. Compared with targeting seeders with all budget, larger influence spread is achieved when we allocation the budget to both seeders and boosted users. This also shows that our study complements the IM studies.

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

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

[3]  John C. S. Lui,et al.  Analyzing competitive influence maximization problems with partial information: An approximation algorithmic framework , 2015, Perform. Evaluation.

[4]  Eleni Constantinou,et al.  "With a little help from new friends": Boosting information cascades in social networks based on link injection , 2014, J. Syst. Softw..

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

[6]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

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

[9]  Martin Ester,et al.  A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.

[10]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

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

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

[13]  Tad Hogg,et al.  Social dynamics of Digg , 2010, EPJ Data Science.

[14]  Wei Chen,et al.  Maximizing acceptance probability for active friending in online social networks , 2013, KDD.

[15]  Rajeev Rastogi,et al.  Recommendations to boost content spread in social networks , 2012, WWW.

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

[17]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

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

[19]  Jian Pei,et al.  Continuous Influence Maximization: What Discounts Should We Offer to Social Network Users? , 2016, SIGMOD Conference.

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

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

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

[23]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.

[24]  Krishna P. Gummadi,et al.  A measurement-driven analysis of information propagation in the flickr social network , 2009, WWW '09.

[25]  Kristina Lerman,et al.  The Simple Rules of Social Contagion , 2013, Scientific Reports.

[26]  Alexandros Nanopoulos,et al.  Crossing the Boundaries of Communities via Limited Link Injection for Information Diffusion In Social Networks , 2015, WWW.

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

[28]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[29]  John C. S. Lui,et al.  Boosting Information Spread: An Algorithmic Approach , 2017, ICDE.

[30]  Alexandros Nanopoulos,et al.  Link injection for boosting information spread in social networks , 2014, Social Network Analysis and Mining.

[31]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[32]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

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

[34]  Stefan M. Wild,et al.  Maximizing influence in a competitive social network: a follower's perspective , 2007, ICEC.

[35]  Laks V. S. Lakshmanan,et al.  Information and Influence Propagation in Social Networks , 2013, Synthesis Lectures on Data Management.

[36]  Yiming Yang,et al.  Introducing the Enron Corpus , 2004, CEAS.

[37]  Wei Chen,et al.  Combining Traditional Marketing and Viral Marketing with Amphibious Influence Maximization , 2015, EC.