Profit Maximization for Viral Marketing in Online Social Networks: Algorithms and Analysis

Information can be disseminated widely and rapidly through Online Social Networks (OSNs) with “word-of-mouth” effects. Viral marketing is such a typical application in which new products or commercial activities are advertised by some seed users in OSNs to other users in a cascading manner. The selection of initial seed users yields a tradeoff between the expense and reward of viral marketing. In this paper, we define a general profit metric that naturally combines the benefit of influence spread with the cost of seed selection in viral marketing. We carry out a comprehensive study on finding a set of seed nodes to maximize the profit of viral marketing. We show that the profit metric is significantly different from the influence metric in that it is no longer monotone. This characteristic differentiates the profit maximization problem from the traditional influence maximization problem. We develop new seed selection algorithms for profit maximization with strong approximation guarantees. We also derive several upper bounds to benchmark the practical performance of an algorithm on any specific problem instance. Experimental evaluations with real OSN datasets demonstrate the effectiveness of our algorithms and techniques.

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

[2]  Junsong Yuan,et al.  Online Processing Algorithms for Influence Maximization , 2018, SIGMOD Conference.

[3]  Junsong Yuan,et al.  Profit maximization for viral marketing in Online Social Networks , 2016, 2016 IEEE 24th International Conference on Network Protocols (ICNP).

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

[5]  Laks V. S. Lakshmanan,et al.  Viral Marketing Meets Social Advertising: Ad Allocation with Minimum Regret , 2014, Proc. VLDB Endow..

[6]  Takuya Akiba,et al.  Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations , 2014, AAAI.

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

[8]  Junsong Yuan,et al.  Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach , 2017, 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[9]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[10]  David B. Shmoys,et al.  Maximizing the Spread of Cascades Using Network Design , 2010, UAI.

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

[12]  Cheng Long,et al.  Minimizing Seed Set for Viral Marketing , 2011, 2011 IEEE 11th International Conference on Data Mining.

[13]  Deying Li,et al.  Influence and Profit: Two Sides of the Coin , 2013, 2013 IEEE 13th International Conference on Data Mining.

[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]  Aristides Gionis,et al.  STRIP: stream learning of influence probabilities , 2013, KDD.

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

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

[18]  U. Feige,et al.  Maximizing Non-monotone Submodular Functions , 2011 .

[19]  Vahab S. Mirrokni,et al.  Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints , 2009, SIAM J. Discret. Math..

[20]  David C. Parkes,et al.  Learnability of Influence in Networks , 2015, NIPS.

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

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

[23]  Eric Balkanski,et al.  The limitations of optimization from samples , 2015, STOC.

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

[25]  Laks V. S. Lakshmanan,et al.  Profit Maximization over Social Networks , 2012, 2012 IEEE 12th International Conference on Data Mining.

[26]  Vahab S. Mirrokni,et al.  Optimal marketing strategies over social networks , 2008, WWW.

[27]  John C. S. Lui,et al.  On Modeling Product Advertisement in Large-Scale Online Social Networks , 2012, IEEE/ACM Transactions on Networking.

[28]  Rishabh K. Iyer,et al.  Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints , 2013, NIPS.

[29]  Jure Leskovec,et al.  {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

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

[31]  Rishabh K. Iyer,et al.  Fast Semidifferential-based Submodular Function Optimization , 2013, ICML.

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

[33]  Bernhard Schölkopf,et al.  Uncovering the Temporal Dynamics of Diffusion Networks , 2011, ICML.

[34]  Peng Zhang,et al.  Minimizing seed set selection with probabilistic coverage guarantee in a social network , 2014, KDD.

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

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

[37]  Thang N. Dinh,et al.  Cost-aware Targeted Viral Marketing in billion-scale networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[38]  Joseph Naor,et al.  A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization , 2015, SIAM J. Comput..

[39]  My T. Thai,et al.  Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks , 2016, SIGMOD Conference.

[40]  Le Song,et al.  Scalable Influence Estimation in Continuous-Time Diffusion Networks , 2013, NIPS.

[41]  Gennaro Cordasco,et al.  Influence propagation over large scale social networks , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

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

[43]  Vahab Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.