Link injection for boosting information spread in social networks

Social media have become popular platforms for spreading information. Several applications, such as ‘viral marketing’, pause the requirement for attaining large-scale information spread in the form of word-of-mouth that reaches a large number of users. In this paper, we propose a novel method that predicts new social links that can be inserted among existing users of a social network, aiming directly at boosting information spread and increasing its reach. We refer to this task as ‘link injection’, because unlike most existing people-recommendation methods, it focuses directly on information spread. A set of candidate links for injection is first predicted in a collaborative-filtering fashion, which generates personalized candidate connections. We select among the candidate links a constrained number that will be finally injected based on a novel application of a score that measures the importance of nodes in a social graph, following the strategy of injecting links adjacent to the most important nodes. The proposed method is suitable for real-world applications, because the injected links manage to substantially increase the reach of information spread by controlling at the same time the number of injected links not to affect the user experience. We evaluate the performance of our proposed methodology by examining several real data sets from social networks under several distinct factors. The experimentation demonstrates the effectiveness of our proposed method, which increases the spread by more than a twofold factor by injecting as few as half of the existing number of links.

[1]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[2]  Huan Liu,et al.  Uncoverning Groups via Heterogeneous Interaction Analysis , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[3]  Yiannis Kompatsiaris,et al.  Community detection in Social Media , 2012, Data Mining and Knowledge Discovery.

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

[5]  Aristides Gionis,et al.  Social Network Analysis and Mining for Business Applications , 2011, TIST.

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

[7]  Martin Bichler,et al.  Identification of influencers - Measuring influence in customer networks , 2008, Decis. Support Syst..

[8]  U. Feige,et al.  Spectral Graph Theory , 2015 .

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

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

[11]  Leon W. Cohen,et al.  Conference Board of the Mathematical Sciences , 1963 .

[12]  Christos Faloutsos,et al.  On the Vulnerability of Large Graphs , 2010, 2010 IEEE International Conference on Data Mining.

[13]  Rajesh Parekh,et al.  Predicting product adoption in large-scale social networks , 2010, CIKM.

[14]  Laks V. S. Lakshmanan,et al.  On minimizing budget and time in influence propagation over social networks , 2012, Social Network Analysis and Mining.

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

[16]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

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

[18]  Matthew O. Jackson,et al.  An Overview of Social Networks and Economic Applications , 2011 .

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

[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]  Kon Shing Kenneth Chung,et al.  Quantifying topological robustness of networks under sustained targeted attacks , 2013, Social Network Analysis and Mining.

[22]  Karen Zita Haigh,et al.  Robust features of trust in social networks , 2013, Social Network Analysis and Mining.

[23]  Thomas Mussweiler,et al.  Numeric Judgments under Uncertainty: The Role of Knowledge in Anchoring , 2000 .

[24]  Marco Rosa,et al.  Robustness of social and web graphs to node removal , 2013, Social Network Analysis and Mining.

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

[26]  Masahiro Kimura,et al.  Selecting Information Diffusion Models over Social Networks for Behavioral Analysis , 2010, ECML/PKDD.

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

[28]  Shirley Gregor,et al.  Internet Marketing Communications: Interactivity and Integration , 2002, E-Business: Multidisciplinary Research and Practice.

[29]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

[30]  Cécile Favre,et al.  Information diffusion in online social networks: a survey , 2013, SGMD.

[31]  Jaideep Srivastava,et al.  Impact of social influence in e-commerce decision making , 2007, ICEC.

[32]  Michael W. Berry,et al.  Algorithms and applications for approximate nonnegative matrix factorization , 2007, Comput. Stat. Data Anal..

[33]  Charles X. Ling,et al.  AUC: A Better Measure than Accuracy in Comparing Learning Algorithms , 2003, Canadian Conference on AI.

[34]  Ido Guy,et al.  Do you know?: recommending people to invite into your social network , 2009, IUI.

[35]  John Hannon,et al.  Recommending twitter users to follow using content and collaborative filtering approaches , 2010, RecSys '10.

[36]  Rossano Schifanella,et al.  Folks in Folksonomies: social link prediction from shared metadata , 2010, WSDM '10.

[37]  Michael J. Muller,et al.  Make new friends, but keep the old: recommending people on social networking sites , 2009, CHI.

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

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

[40]  Jan U. Becker,et al.  Seeding Strategies for Viral Marketing: An Empirical Comparison , 2011 .

[41]  Hongwei Liu,et al.  Solving non-negative matrix factorization by alternating least squares with a modified strategy , 2013, Data Mining and Knowledge Discovery.

[42]  Yung-Ming Li,et al.  A diffusion mechanism for social advertising over microblogs , 2012, Decis. Support Syst..

[43]  Tamara Dinev,et al.  Is There an On-line Advertisers' Dilemma? A Study of Click Fraud in the Pay-Per-Click Model , 2008, Int. J. Electron. Commer..