Cheng-Te Li
ABSTRACT
This paper aims to combine the viral marketing with the idea of direct selling to for influence maximization in a social network. In direct selling, producers can sell the products directly to the consumers without having to go through a cascade of wholesalers. Through direct selling, it is possible to sell the products in a more efficient and economic manner. Motivated by this idea, we propose a target-selecting independent cascade (TIC) model, in which during influence propagation each active node can give up to attempt to influence some neighboring nodes, named victims, who could be hard to affect, and try to activate some of its friends of friends, termed destinations, who could have higher potential to increase the influence spread. Thus, the next question to ask is that given a social network and a set of seeds for influence propagation under TIC model, how to select targets (i.e., victims and destinations) for the attempts of activation during the propagation to boost of influence spread. We propose and evaluate three heuristics for the target selection. Experiments show that selecting targets based on influence probability between nodes have the highest boost of influence spread.
- W. Chen, Y. Wang, and S. Yang. Efficient Influence Maximization in Social Networks. In KDD 2009. Google Scholar
Digital Library
- D. Cosley, D. Huttenlocher, J. Kleinberg, X. Lan, and S. Suri. Sequential Influence Models in Social Networks. In ICWSM 2010.Google Scholar
- D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the Spread of Influence through a Social Network. In KDD 2003. Google ScholarDigital Library
- T. Lappas, E. Terzi, D. Gunopulos, and H. Mannila. Finding Effectors in Social Networks. In KDD 2010. Google ScholarDigital Library
- C.-T. Li, S.-D. Lin, and M.-K. Shan. Finding Influential Mediators in Social Networks. In WWW 2011. Google ScholarDigital Library
- J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective Outbreak Detection in Networks. In KDD 2007. Google ScholarDigital Library
- M. Mathioudakis, F. Bonchi, C. Castillo, A. Gionis, and A. Ukkonen. Sparsification of Influence Networks. In KDD 2011. Google ScholarDigital Library
- J. Yang and J. Leskovec. Modeling Information Diffusion in Implicit Networks. In ICDM 2010. Google ScholarDigital Library
Index Terms
- Dynamic selection of activation targets to boost the influence spread in social networks
Recommendations
The bang for the buck: fair competitive viral marketing from the host perspective
KDD '13: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data miningThe key algorithmic problem in viral marketing is to identify a set of influential users (called seeds) in a social network, who, when convinced to adopt a product, shall influence other users in the network, leading to a large number of adoptions. When ...
Maximizing influence under influence loss constraint in social networks
Formulate a new influence maximization problem in social networks.Propose a new algorithm to solve the problem.Improve the new algorithm to achieve more efficiency.Experiment the methods in four real-world social networks. Influence maximization is a ...
Maximizing Information Spread through Influence Structures in Social Networks
ICDMW '12: Proceedings of the 2012 IEEE 12th International Conference on Data Mining WorkshopsFinding the most influential nodes in a network is a much discussed research topic of recent time in the area of network science, especially in social network analysis. The topic of this paper is a related, but harder problem. Given a social network ...
Comments