Influential Sustainability on Social Networks

In this paper, we study a novel paradigm of viral marketing with the goal to sustain the influential effectiveness in the network. We study from real cases such as the Ice Bucket Challenges for the ALS awareness, and figure out the "easy come and easy go" phenomenon in the marketing promotion. Such a natural property is fully unexplored in the literature, but it will violate the need of many marketing applications which attempt to receive the perpetual attention and support. We thus highlight the problem of Influential Sustainability, to pursue the long-term and effective influence on the network. Given the set of initial seeds S and a threshold ρ, the goal of Influential Sustainability is to best decide the timing to activate each seed in S so as to maximize the number of iterations in which each iteration will activate the number of inactive nodes more than ρ. The Influential Sustainability problem is challenging due to its #P-hard nature. In addition to the greedy idea, we further present three strategies to heuristically decide the activating timing for each seed. As demonstrated in the empirical study on real data, instead of only providing the flexibility of striking a compromise between the execution efficiency and the resulting quality, these heuristic algorithms can be executed highly efficiently and meanwhile it is able to sustain the longer period which can continuously activate inactive nodes effectively. The results demonstrate their prominent advantage to be practical algorithms for the promising viral marketing paradigm.

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

[2]  Jinha Kim,et al.  Scalable and parallelizable processing of influence maximization for large-scale social networks? , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

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

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

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

[6]  Ning Zhang,et al.  Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process , 2012, AAAI.

[7]  Yu Wang,et al.  Community-based greedy algorithm for mining top-K influential nodes in mobile social networks , 2010, KDD.

[8]  Masahiro Kimura,et al.  Extracting Influential Nodes for Information Diffusion on a Social Network , 2007, AAAI.

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

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

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

[12]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[13]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

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

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

[16]  Laks V. S. Lakshmanan,et al.  A Data-Based Approach to Social Influence Maximization , 2011, Proc. VLDB Endow..

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

[18]  Gao Cong,et al.  Simulated Annealing Based Influence Maximization in Social Networks , 2011, AAAI.

[19]  Dong Xu,et al.  Time Constrained Influence Maximization in Social Networks , 2012, 2012 IEEE 12th International Conference on Data Mining.

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

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