UBLF: An upper bound based approach to discover influential nodes in social networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2013, Pages 907-916

  Zhou, Chuan ^a   Zhang, Peng ^a   Guo, Jing ^a,b   Zhu, Xingquan ^c   Guo, Li ^a  

^a University of Chinese Academy of Sciences   (China)

^b BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^c FLORIDA ATLANTIC UNIVERSITY   (United States)

Author keywords

Greedy Algorithms; Independent Cascade Model; Influence Maximization; Social Networks

Indexed keywords

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

References (23)

1. N. Barbieri, F. Bonchi, and G. Manco, "Topic-aware Social Influence Propagation Models," in ICDM 2012.
2. F. Bonchi, "Influence propagation in social networks: A data mining perspective," IEEE Intelligent Informatics Bulletin, Vol.12, No.1, 2011.
3. S. Brin, and L. Page, "The anatomy of a large-scale hypertextual web search engine," Computer Networks, vol. 30, no. 1-7, pp. 107-117, 1998.
4. W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in KDD 2009.
5. W. Chen, C. Wang, and Y. Wang, "Scalable influence maximization for prevalent viral marketing in large-scale social networks," in KDD 2010.
6. W. Chen, Y. Yuan, and L. Zhang, "Scalable influence maximization in social networks under the linear threshold model," in ICDM 2010.
7. P. Domingos and M. Richardson, "Mining the network value of customers," in KDD 2001.
8. A. Goyal, F. Bonchi, and L. V. Lakshmanan, "Learning influence probabilities in social networks," in WSDM 2010.
9. A. Goyal, F. Bonchi, and L. V. Lakshmanan, "A data-based approach to social influence maximization," in PVLDB 2012.
10. A. Goyal, W. Lu, and L. V. S. Lakshmanan, "CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks," in WWW 2011.
11. A. Goyal, W. Lu, and L. V. S. Lakshmanan, "SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model," in ICDM 2011.
12. J. Guo, P. Zhang, C. Zhou, Y. Cao, and L. Guo, "Personalized influence maximization on social networks," in CIKM 2013.
13. R. A. Horn and C. R. Johnson, "Matrix analysis," Cambridge university press, 1990.
14. D. Kempe, J. M. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network," in KDD 2003.
15. M. Kimura and K. Saito, "Tractable models for information diffusion in social networks," in ECML PKDD 2006.
16. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Van-Briesen, and N. Glance, "Cost-effective outbreak detection in networks," in KDD 2007.
17. E. Mossel and S. Rich, "On the Submodularity of Influence in Social Networks," in STOC 2007.
18. R. Narayanam and Y. Narahari, "A shapley value based approach to discover influential nodes in social networks," in TASAE 2010.
19. G. Nemhauser, L. Wolsey, and M. Fisher, "An analysis of the approximations for maximizing submodular set functions," Mathematical Programming, 14: 265-294, 1978.
20. M. Richardson and P. Domingos, "Mining knowledge-sharing sites for viral marketing," in KDD 2002.
21. K. Saito, R. Nakano, and M. Kimura, "Prediction of information diffusion probabilities for independent cascade model," in KES 2008.
22. J. Tang, J. Sun, C. Wang, and Z. Yang, "Social influence analysis in large-scale networks," in KDD 2009.
23. Y. Wang, G. Cong, G. Song, and K. Xie, "Community-based greedy algorithm for mining top-k influential nodes in mobile social networks," in KDD 2010.