Influence Maximization over Large-Scale Social Networks: A Bounded Linear Approach

Information diffusion in social networks is emerging as a promising solution to successful viral marketing, which relies on the effective and efficient identification of a set of nodes with the maximal social influence. While there are tremendous efforts on the development of social influence models and algorithms for social influence maximization, limited progress has been made in terms of designing both efficient and effective algorithms for finding a set of nodes with the maximal social influence. To this end, in this paper, we provide a bounded linear approach for influence computation and influence maximization. Specifically, we first adopt a linear and tractable approach to describe the influence propagation. Then, we develop a quantitative metric, named Group-PageRank, to quickly estimate the upper bound of the social influence based on this linear approach. More importantly, we provide two algorithms Linear and Bound, which exploit the linear approach and Group-PageRank for social influence maximization. Finally, extensive experimental results demonstrate that (a) the adopted linear approach has a close relationship with traditional models and Group-PageRank provides a good estimation of social influence; (b) Linear and Bound can quickly find a set of the most influential nodes and both of them are scalable for large-scale social networks.

[1]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

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

[3]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

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

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

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

[7]  Charu C. Aggarwal,et al.  Content-centric flow mining for influence analysis in social streams , 2013, CIKM.

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

[9]  Enhong Chen,et al.  Linear Computation for Independent Social Influence , 2013, 2013 IEEE 13th International Conference on Data Mining.

[10]  Jure Leskovec,et al.  Supervised random walks: predicting and recommending links in social networks , 2010, WSDM '11.

[11]  Xueqi Cheng,et al.  StaticGreedy: solving the scalability-accuracy dilemma in influence maximization , 2012, CIKM.

[12]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[13]  Jingrui He,et al.  Diversified ranking on large graphs: an optimization viewpoint , 2011, KDD.

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

[15]  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.

[16]  Jiawei Han,et al.  Mining topic-level influence in heterogeneous networks , 2010, CIKM.

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

[18]  Charu C. Aggarwal,et al.  Social Network Data Analytics , 2011 .

[19]  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.

[20]  Hui Xiong,et al.  PageRank with Priors: An Influence Propagation Perspective , 2013, IJCAI.

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

[22]  Taher H. Haveliwala.  Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search , 2003, IEEE Trans. Knowl. Data Eng..

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

[24]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

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

[26]  Enhong Chen,et al.  On Approximation of Real-World Influence Spread , 2012, ECML/PKDD.

[27]  Laks V. S. Lakshmanan,et al.  Approximation Analysis of Influence Spread in Social Networks , 2010, ArXiv.

[28]  Charu C. Aggarwal,et al.  On Flow Authority Discovery in Social Networks , 2011, SDM.

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

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

[31]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[32]  Wonyeol Lee,et al.  CT-IC: Continuously Activated and Time-Restricted Independent Cascade Model for Viral Marketing , 2012, 2012 IEEE 12th International Conference on Data Mining.

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

[34]  Ravi Kumar,et al.  Influence and correlation in social networks , 2008, KDD.

[35]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[36]  Philip S. Yu,et al.  Influence and similarity on heterogeneous networks , 2012, CIKM.

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

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

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

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

[41]  Jinha Kim,et al.  Scalable and parallelizable processing of influence maximization for large-scale social networks? , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

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

[43]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[44]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[45]  Enhong Chen,et al.  Probabilistic solutions of influence propagation on social networks , 2013, CIKM.

[46]  Hongyan Liu,et al.  Ranking Individuals and Groups by Influence Propagation , 2011, PAKDD.

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

[48]  Zoubin Ghahramani,et al.  Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.