Real-time Targeted Influence Maximization for Online Advertisements

Advertising in social network has become a multi-billion-dollar industry. A main challenge is to identify key influencers who can effectively contribute to the dissemination of information. Although the influence maximization problem, which finds a seed set of k most influential users based on certain propagation models, has been well studied, it is not target-aware and cannot be directly applied to online advertising. In this paper, we propose a new problem, named Keyword-Based Targeted Influence Maximization (KB-TIM), to find a seed set that maximizes the expected influence over users who are relevant to a given advertisement. To solve the problem, we propose a sampling technique based on weighted reverse influence set and achieve an approximation ratio of (1 − 1/e − e). To meet the instant-speed requirement, we propose two disk-based solutions that improve the query processing time by two orders of magnitude over the state-of-the-art solutions, while keeping the theoretical bound. Experiments conducted on two real social networks confirm our theoretical findings as well as the efficiency. Given an advertisement with 5 keywords, it takes only 2 seconds to find the most influential users in a social network with billions of edges.

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  TanKian-Lee,et al.  Real-time targeted influence maximization for online advertisements , 2015, VLDB 2015.

[3]  JUSTIN ZOBEL,et al.  Inverted files for text search engines , 2006, CSUR.

[4]  Wei Chen,et al.  Efficient Topic-aware Influence Maximization Using Preprocessing , 2014, ArXiv.

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

[6]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

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

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[10]  Kian-Lee Tan,et al.  Efficient location-aware influence maximization , 2014, SIGMOD Conference.

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

[12]  Nicola Barbieri,et al.  Topic-aware social influence propagation models , 2012, Knowledge and Information Systems.

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

[14]  Christian Borgs,et al.  Influence Maximization in Social Networks: Towards an Optimal Algorithmic Solution , 2012, ArXiv.

[15]  Jinhui Tang,et al.  Online Topic-Aware Influence Maximization , 2015, Proc. VLDB Endow..

[16]  Jacob Goldenberg,et al.  Using Complex Systems Analysis to Advance Marketing Theory Development , 2001 .

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

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

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

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

[21]  Brian D. Davison,et al.  Empirical study of topic modeling in Twitter , 2010, SOMA '10.

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

[23]  Cheng-Te Li,et al.  Labeled Influence Maximization in Social Networks for Target Marketing , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[24]  Nicola Barbieri,et al.  Online Topic-aware Influence Maximization Queries , 2014, EDBT.

[25]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS '01.