On the Shoulders of Giants: Incremental Influence Maximization in Evolving Social Networks

Identifying the most influential individuals can provide invaluable help in developing and deploying effective viral marketing strategies. Previous studies mainly focus on designing efficient algorithms or heuristics to find top-K influential nodes on a given static social network. While, as a matter of fact, real-world social networks keep evolving over time and a recalculation upon the changed network inevitably leads to a long running time, significantly affecting the efficiency. In this paper, we observe from real-world traces that the evolution of social network follows the preferential attachment rule and the influential nodes are mainly selected from high-degree nodes. Such observations shed light on the design of IncInf, an incremental approach that can efficiently locate the top-K influential individuals in evolving social networks based on previous information instead of calculation from scratch. In particular, IncInf quantitatively analyzes the influence spread changes of nodes by localizing the impact of topology evolution to only local regions, and a pruning strategy is further proposed to effectively narrow the search space into nodes experiencing major increases or with high degrees. We carried out extensive experiments on real-world dynamic social networks including Facebook, NetHEPT, and Flickr. Experimental results demonstrate that, compared with the state-of-the-art static heuristic, IncInf achieves as much as 21X speedup in execution time while maintaining matching performance in terms of influence spread.

[1]  Hernán A. Makse,et al.  Efficient collective influence maximization in cascading processes with first-order transitions , 2016, Scientific Reports.

[2]  Shaojie Tang,et al.  Adaptive Influence Maximization in Dynamic Social Networks , 2015, IEEE/ACM Transactions on Networking.

[3]  Xiaodong Liu,et al.  Towards Efficient Influence Maximization for Evolving Social Networks , 2016, APWeb.

[4]  Yingshu Li,et al.  An exploration of broader influence maximization in timeliness networks with opportunistic selection , 2016, J. Netw. Comput. Appl..

[5]  Li Guo,et al.  On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization , 2015, IEEE Transactions on Knowledge and Data Engineering.

[6]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

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

[8]  Yu Wang,et al.  Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method , 2015, IEEE Transactions on Parallel and Distributed Systems.

[9]  Masoud Asadpour,et al.  SMG: Fast scalable greedy algorithm for influence maximization in social networks , 2015 .

[10]  Weili Wu,et al.  Efficient influence spread estimation for influence maximization under the linear threshold model , 2014, Computational Social Networks.

[11]  Dong Xu,et al.  Influence Spreading Path and Its Application to the Time Constrained Social Influence Maximization Problem and Beyond , 2014, IEEE Transactions on Knowledge and Data Engineering.

[12]  Przemyslaw Kazienko,et al.  Seed Selection for Spread of Influence in Social Networks: Temporal vs. Static Approach , 2014, New Generation Computing.

[13]  Xue-Guang Wang An Algorithm for Critical Nodes Problem in Social Networks Based on Owen Value , 2014, TheScientificWorldJournal.

[14]  Jong-Ryul Lee,et al.  A fast approximation for influence maximization in large social networks , 2014, WWW.

[15]  Suh-Yin Lee,et al.  CIM: Community-Based Influence Maximization in Social Networks , 2014, TIST.

[16]  Wei Chen,et al.  IMRank: influence maximization via finding self-consistent ranking , 2014, SIGIR.

[17]  Xiaodong Liu,et al.  IMGPU: GPU-Accelerated Influence Maximization in Large-Scale Social Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[18]  Jie Tang,et al.  Influence Maximization in Dynamic Social Networks , 2013, 2013 IEEE 13th International Conference on Data Mining.

[19]  Victor P. Corona Memory, Monsters, and Lady Gaga , 2013 .

[20]  Andreas Krause,et al.  Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization , 2013, ICML.

[21]  Rong Zheng,et al.  On Budgeted Influence Maximization in Social Networks , 2012, IEEE Journal on Selected Areas in Communications.

[22]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[23]  Philip S. Yu,et al.  On Influential Node Discovery in Dynamic Social Networks , 2012, SDM.

[24]  Weili Wu,et al.  The complexity of influence maximization problem in the deterministic linear threshold model , 2012, J. Comb. Optim..

[25]  Suh-Yin Lee,et al.  Efficient algorithms for influence maximization in social networks , 2012, Knowledge and Information Systems.

[26]  Bernhard Schölkopf,et al.  Influence Maximization in Continuous Time Diffusion Networks , 2012, ICML.

[27]  Ning Zhang,et al.  Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process , 2012, AAAI.

[28]  Xiaodong Liu,et al.  In-time estimation for influence maximization in large-scale social networks , 2012, SNS '12.

[29]  Wei Chen,et al.  Scalable influence maximization for independent cascade model in large-scale social networks , 2012, Data Mining and Knowledge Discovery.

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

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

[32]  Laks V. S. Lakshmanan,et al.  A Data-Based Approach to Social Influence Maximization , 2011, Proc. VLDB Endow..

[33]  Gao Cong,et al.  Simulated Annealing Based Influence Maximization in Social Networks , 2011, AAAI.

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

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

[36]  Yu Wang,et al.  Community-based greedy algorithm for mining top-K influential nodes in mobile social networks , 2010, KDD.

[37]  Krishna P. Gummadi,et al.  Measuring User Influence in Twitter: The Million Follower Fallacy , 2010, ICWSM.

[38]  David Easley,et al.  Networks, Crowds, and Markets: Power Laws and Rich-Get-Richer Phenomena , 2010 .

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

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

[41]  Jimeng Sun,et al.  Social influence analysis in large-scale networks , 2009, KDD.

[42]  Tanya Y. Berger-Wolf,et al.  Finding Spread Blockers in Dynamic Networks , 2008, SNAKDD.

[43]  Jure Leskovec,et al.  Microscopic evolution of social networks , 2008, KDD.

[44]  Krishna P. Gummadi,et al.  Growth of the flickr social network , 2008, WOSN '08.

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

[46]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[47]  Guido Caldarelli,et al.  Preferential attachment in the growth of social networks: the case of Wikipedia , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[48]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[49]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

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

[51]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.