How to maximize advertising performance in online social networks

Abstract The influence maximization problem is widely studied, but previous studies have assumed that the cost to activate each seed node was identical. In this paper, we consider different activation costs and investigate a new problem: the budget-aware influence maximization problem (BIM). This problem is NP-hard, which motivates our interest in its approximation. We develop two greedy algorithms for BIM, namely, BG and GMUI, and show that GMUI obtains a solution that is provably . Then, we consider the average profit to activate a common user and introduce GMUN, an improved GMUI algorithm. Finally, we evaluate our algorithms with experiments using two large real social networks. The results show that GMUI performs best in terms of influence, whereas GMUN creates leverage between the budget and net income, indicating that the marginal net income/costs ratio for each seed node selected by GMUN can satisfy enterprises.

[1]  Hernán A. Makse,et al.  Spreading dynamics in complex networks , 2013, ArXiv.

[2]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

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

[4]  Edith Cohen,et al.  Sketch-based Influence Maximization and Computation: Scaling up with Guarantees , 2014, CIKM.

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

[6]  Wei Chen,et al.  Participation Maximization Based on Social Influence in Online Discussion Forums , 2011, ICWSM.

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

[8]  Hernán A. Makse,et al.  Collective Influence Algorithm to find influencers via optimal percolation in massively large social media , 2016, Scientific Reports.

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

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

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

[12]  Laks V. S. Lakshmanan,et al.  SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model , 2011, 2011 IEEE 11th International Conference on Data Mining.

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

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

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

[16]  Hernán A. Makse,et al.  Efficient collective influence maximization in cascading processes with first-order transitions , 2016, Scientific Reports.

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

[18]  Sean J. Taylor,et al.  Social Influence Bias: A Randomized Experiment , 2013, Science.

[19]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[20]  Kenneth Nyberg,et al.  Sociology , 2002, Encyclopedia of Information Systems.

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

[22]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.