A Note on Influence Maximization in Social Networks from Local to Global and Beyond

Abstract In this paper, we study a new problem on social network influence maximization. The problem is defined as, given an acti- vatable set A and a targeted set T , finding the k nodes in A with the maximal influence in T . Different from existing influence maximization work which aims to find a small subset of nodes to maximize the spread of influence over the entire network (i.e., from whole to whole), our problem aims to find a small subset of given activatable nodes which can maximize the influence spread to a targeted subset (i.e., from part to part). Theoretically the new frame includes the common influence maximization as its special case. The solution is critical for personalized services, targeted information dissemination, and local viral mar- keting on social networks, where fully understanding of constraint influence diffusion is essential. To this end, in this paper we propose a constraint influence maximization frame. Specifically, we point out that it is NP-hard and can be approximated by greedy algorithm with guarantee of 1 − 1/ e . We also elaborate two special cases: the local one and the global one. Besides, we present the works that are related and beyond.

[1]  Francesco Bonchi,et al.  Influence Propagation in Social Networks: A Data Mining Perspective , 2011, 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

[2]  Wei Chen,et al.  Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships , 2011, WSDM.

[3]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

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

[5]  Li Guo,et al.  An upper bound based greedy algorithm for mining top-k influential nodes in social networks , 2014, WWW '14 Companion.

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

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

[8]  Laks V. S. Lakshmanan,et al.  SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model , 2011, 2011 IEEE 11th International Conference on Data Mining.

[9]  Masahiro Kimura,et al.  Tractable Models for Information Diffusion in Social Networks , 2006, PKDD.

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

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

[12]  Eyal Even-Dar,et al.  A note on maximizing the spread of influence in social networks , 2007, Inf. Process. Lett..

[13]  Li Guo,et al.  Maximizing the Cumulative Influence through a Social Network when Repeat Activation Exists , 2014, ICCS.

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

[15]  Elchanan Mossel,et al.  Submodularity of Influence in Social Networks: From Local to Global , 2010, SIAM J. Comput..

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

[17]  Li Guo,et al.  UBLF: An Upper Bound Based Approach to Discover Influential Nodes in Social Networks , 2013, 2013 IEEE 13th International Conference on Data Mining.

[18]  Li Guo,et al.  Item-Based Top-k Influential User Discovery in Social Networks , 2013, 2013 IEEE 13th International Conference on Data Mining Workshops.

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

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

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

[22]  Nicola Barbieri,et al.  Topic-Aware Social Influence Propagation Models , 2012, ICDM.

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

[24]  Chuan Zhou,et al.  Personalized influence maximization on social networks , 2013, CIKM.

[25]  Masahiro Kimura,et al.  Prediction of Information Diffusion Probabilities for Independent Cascade Model , 2008, KES.

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

[27]  Li Guo,et al.  Maximizing the long-term integral influence in social networks under the voter model , 2014, WWW.