Scalable influence maximization in social networks under the linear threshold model

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 88-97

  Chen, Wei ^a   Yuan, Yifei ^b   Zhang, Li ^c  

^a MICROSOFT RESEARCH ASIA   (China)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Influence maximization; Linear threshold model; Social networks

Indexed keywords

DIRECTED ACYCLIC GRAPHS; EXTENSIVE SIMULATIONS; FAST COMPUTATION; GENERAL NETWORKS; GREEDY APPROXIMATION ALGORITHMS; INFLUENCE MAXIMIZATIONS; LINEAR THRESHOLD MODEL; OPEN PROBLEMS; ORDERS OF MAGNITUDE; REAL-WORLD NETWORKS; SOCIAL NETWORKS; THRESHOLD MODEL;

APPROXIMATION ALGORITHMS; COMPUTER SIMULATION; DATA MINING; HEURISTIC ALGORITHMS; OPTIMIZATION; SOCIAL NETWORKING (ONLINE);

ECONOMIC AND SOCIAL EFFECTS;

EID: 79951737128     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.118     Document Type: Conference Paper

References (20)

1. D. Kempe, J. M. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network," in KDD 2003.
2. -, "Influential nodes in a diffusion model for social networks," in ICALP 2005.
3. M. Kimura and K. Saito, "Tractable models for information diffusion in social networks," in ECML PKDD 2006.
4. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Van-Briesen, and N. S. Glance, "Cost-effective outbreak detection in networks," in KDD 2007.
5. R. Narayanam and Y. Narahari, "A shapley value based approach to discover influential nodes in social networks," IEEE Transactions on Automation Science and Engineering, 2010, to appear.
6. W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in KDD 2009.
7. W. Chen, C. Wang, and Y. Wang, "Scalable influence maximization for prevalent viral marketing in large scale social networks," in KDD 2010.
8. S. Brin and L. Page, "The anatomy of a large-scale hyper-textual web search engine," Computer Networks, vol. 30, no. 1-7, pp. 107-117, 1998.
9. P. Domingos and M. Richardson, "Mining the network value of customers," in KDD 2001.
10. M. Richardson and P. Domingos, "Mining knowledge-sharing sites for viral marketing," in KDD 2002.
11. A. Anagnostopoulos, R. Kumar, and M. Mahdian, "Influence and correlation in social networks," in KDD 2008.
12. J. Tang, J. Sun, C. Wang, and Z. Yang, "Social influence analysis in large-scale networks," in KDD 2009.
13. K. Saito, M. Kimura, K. Ohara, and H. Motoda, "Selecting information diffusion models over social networks for behavioral analysis," in ECML PKDD 2010.
14. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan, "Learning influence probabilities in social networks," in WSDM 2010.
15. G. Nemhauser, L. Wolsey, and M. Fisher, "An analysis of the approximations for maximizing submodular set functions," Mathematical Programming, vol. 14, pp. 265-294, 1978.
16. L. G. Valiant, "The complexity of enumeration and reliability problems," SIAM Journal on Computing, vol. 8, no. 3, pp. 410-421, 1979.
17. W. Chen, Y. Yuan, and L. Zhang, "Scalable influence maximization in social networks under the linear threshold model," Microsoft Research, Tech. Rep. MSR-TR-2010-133, Oct. 2010.
18. J. Leskovec, "Epinions social network," http://snap.stanford. edu/data/soc-Epinions1.html.
19. -, "Amazon product co-purchasing network, march 02 2003," http://snap.stanford.edu/data/amazon0302.html.
20. L. Cowen, A. Brady, and P. Schmid, "DIGG: DynamIc Graph Generator," http://digg.cs.tufts.edu.