Labeled Influence Maximization in Social Networks for Target Marketing
Authors:
- Fa-Hsien LiFLFa-Hsien Li
- Cheng-Te LiCLCheng-Te Li
- Man-Kwan ShanMSMan-Kwan Shan
- 1 October 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 560-563
Abstract
The influence maximization problem is to find a set of seed nodes which maximize the spread of influence in a social network. The seed nodes are used for the viral marketing to gain the maximum profits through the effective word-of-mouth. However, in more real-world cases, marketers usually target certain products at particular groups of customers. While original influence maximization problem considers no product information and target customers, in this paper, we focus on the target marketing. We propose the labeled influence maximization problem, which aims to find a set of seed nodes which can trigger the maximum spread of influence on the target customers in a labeled social network. We propose three algorithms to solve such labeled influence maximization problem. We first develop the algorithms based on the greedy methods of original influence maximization by considering the target customers. Moreover, we develop a novel algorithm, Maximum Coverage, whose central idea is to offline compute the pair wise proximities of nodes in the labeled social network and online find the set of seed nodes. This allows the marketers to plan and evaluate strategies online for advertised products. The experimental results on IMDb labeled social network show our methods can achieve promising performances on both effectiveness and efficiency.Keywords
This publication has 11 references indexed in Scilit:
- Scalable influence maximization for prevalent viral marketing in large-scale social networks2010
- Finding effectors in social networks2010
- Efficient influence maximization in social networks2009
- Using ghost edges for classification in sparsely labeled networks2008
- Cost-effective outbreak detection in networks2007
- Measuring and extracting proximity in networks2006
- Fast discovery of connection subgraphs2004
- Maximizing the spread of influence through a social network2003
- Mining the network value of customers2001
- An efficient algorithm for K shortest simple pathsNetworks, 1982