Profit maximization for viral marketing in Online Social Networks

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 budget allocation for seed selection reflects 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 to eliminate the need for presetting the budget for seed selection. 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. As a result, from the computability perspective, the problem of profit maximization is much more challenging than that of influence maximization. We develop new seed selection algorithms for profit maximization with strong approximation guarantees. Experimental evaluations with real OSN datasets demonstrate the effectiveness of our algorithms.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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