CELF++: Optimizing the greedy algorithm for influence maximization in social networks

Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011

Volumn , Issue , 2011, Pages 47-48

  Goyal, Amit ^a   Lu, Wei ^a   Lakshmanan, Laks V S ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

CELF; greedy algorithm; influence propagation; social networks; submodularity; viral marketing

Indexed keywords

CELF; GREEDY ALGORITHM; INFLUENCE PROPAGATION; SOCIAL NETWORKS; SUBMODULARITY; VIRAL MARKETING;

COMPUTER SIMULATION; ECONOMIC AND SOCIAL EFFECTS; MARKETING; MONTE CARLO METHODS; OPTIMIZATION; SOCIAL NETWORKING (ONLINE); WORLD WIDE WEB;

APPROXIMATION ALGORITHMS;

EID: 79955154683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1963192.1963217     Document Type: Conference Paper

References (6)

1. W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD 2010.
2. W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD 2009.
3. W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In ICDM 2010.
4. D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD 2003.
5. M. Kimura and K. Saito. Tractable models for information diffusion in social networks. In PKDD 2006.
6. J. Leskovec et al. Cost-effective outbreak detection in networks. In KDD 2007.