Cost-aware Targeted Viral Marketing: Approximation with Less Samples.

Cost-aware Targeted Viral Marketing (CTVM), a generalization of Influence Maximization (IM), has received a lot of attentions recently due to its commercial values. Previous approximation algorithms for this problem required a large number of samples to ensure approximate guarantee. In this paper, we propose an efficient approximation algorithm which uses fewer samples but provides the same theoretical guarantees based on generating and using important samples in its operation. Experiments on real social networks show that our proposed method outperforms the state-of-the-art algorithm which provides the same approximation ratio in terms of the number of required samples and running time.

[1]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

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

[3]  Huiyuan Zhang,et al.  Recent Advances in Information Diffusion and Influence Maximization of Complex Social Networks , 2014 .

[4]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[5]  Laks V. S. Lakshmanan,et al.  Revisiting the Stop-and-Stare Algorithms for Influence Maximization , 2017, Proc. VLDB Endow..

[6]  My T. Thai,et al.  Revisiting of 'Revisiting the Stop-and-Stare Algorithms for Influence Maximization' , 2018, CSoNet.

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

[8]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[9]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[10]  Xiang Li,et al.  Why approximate when you can get the exact? Optimal targeted viral marketing at scale , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[11]  Nam P. Nguyen,et al.  Analysis of misinformation containment in online social networks , 2013, Comput. Networks.

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

[13]  My T. Thai,et al.  Interest-matching information propagation in multiple online social networks , 2012, CIKM.

[14]  My T. Thai,et al.  Maximizing misinformation restriction within time and budget constraints , 2018, Journal of Combinatorial Optimization.

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

[16]  Hung T. Nguyen,et al.  Importance Sketching of Influence Dynamics in Billion-Scale Networks , 2017, 2017 IEEE International Conference on Data Mining (ICDM).

[17]  Fan Chung Graham,et al.  Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..

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

[19]  Azadeh Iranmehr,et al.  Trust Management for Semantic Web , 2009, 2009 Second International Conference on Computer and Electrical Engineering.

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

[21]  Huiling Zhang,et al.  Least Cost Influence Maximization Across Multiple Social Networks , 2016, IEEE/ACM Transactions on Networking.

[22]  Huan Liu,et al.  Mining Misinformation in Social Media , 2016 .

[23]  My T. Thai,et al.  On the approximability of positive influence dominating set in social networks , 2014, J. Comb. Optim..

[24]  My T. Thai,et al.  Competitive Influence Maximization within Time and Budget Constraints in Online Social Networks: An Algorithmic Approach , 2019 .

[25]  My T. Thai,et al.  A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing , 2017, IEEE/ACM Transactions on Networking.

[26]  My T. Thai,et al.  Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? , 2012, HT '12.