Online influence maximization

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2015-August, Issue , 2015, Pages 645-654

  Lei, Siyu ^a   Maniu, Silviu ^b   Mo, Luyi ^a   Cheng, Reynold ^a   Senellart, Pierre ^c  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b HUAWEI NOAH S ARK LAB   (China)

^c INSTITUT TELECOM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; DATA MINING; PROBABILITY;

COMPLETE INFORMATION; CONFIDENCE BOUNDS; INCREMENTAL ALGORITHM; INFLUENCE MAXIMIZATIONS; NUMBER OF PEOPLES; PARTIAL INFORMATION; PROBABILITY ESTIMATION; PROBABILITY INFORMATIONS;

SOCIAL NETWORKING (ONLINE);

EID: 84954098293     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2783258.2783271     Document Type: Conference Paper

References (28)

1. S. Agrawal and N. Goyal. Analysis of thompson sampling for the multi-armed bandit problem. In COLT, 2012.
2. C. Aslay, N. Barbieri, F. Bonchi, and R. A. Baeza-Yates. Online topic-aware influence maximization queries. In EDBT, 2014.
3. P. Auer. Using confidence bounds for exploitation-exploration trade-offs. JMLR, 3:397-422, 2003.
4. C. Borgs, M. Bratbar, J. Chayes, and B. Lucier. Maximizing social influence in nearly optimal time. In SODA, 2014.
5. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
6. W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD, 2010.
7. W. Chen, Y. Wang, and S. Yang. Efficient influence maximization in social networks. In KDD, 2009.
8. W. Chen, Y. Wang, and Y. Yuan. Combinatorial multi-armed bandit: General framework and applications. In ICML, 2013.
9. W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In ICDM, 2010.
10. P. Domingos and M. Richardson. Mining the network value of customers. In KDD, 2001.
11. A. Goyal, F. Bonchi, and L. V. Lakshmanan. Learning influence probabilities in social networks. In WSDM, 2010.
12. A. Goyal, F. Bonchi, and L. V. Lakshmanan. A data-based approach to social influence maximization. PVLDB, 5(1), 2011.
13. A. Goyal, W. Lu, and L. V. Lakshmanan. Celf++: Optimizing the greedy algorithm for influence maximization in social networks. In WWW, 2011.
14. J. Huang, X.-Q. Cheng, H.-W. Shen, T. Zhou, and X. Jin. Exploring social influence via posterior effect of word-of-mouth recommendations. In WSDM, 2012.
15. K. Jung, W. Heo, and W. Chen. Irie: Scalable and robust influence maximization in social networks. In ICDM, 2012.
16. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.
17. J. Kim, S.-K. Kim, and H. Yu. Scalable and parallelizable processing of influence maximization for large-scale social networks? In ICDE, 2013.
18. S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart. Online influence maximization (extended version). arXiv:1056.01188, 2015.
19. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In KDD, 2007.
20. M. J. Lovett, R. Peres, and R. Shachar. On brands and word of mouth. J. Marketing Research, 50(4), 2013.
21. W. Lu, F. Bonchi, A. Goyal, and L. V. Lakshmanan. The bang for the buck: Fair competitive viral marketing from the host perspective. KDD, 2013.
22. S. Richard and A. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.
23. M. Richardson and P. Domingos. Mining knowledge-sharing sites for viral marketing. In KDD 2002.
24. H. Robbins. Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc., 58(5), 1952.
25. K. Saito, R. Nakano, and M. Kimura. Prediction of information diffusion probabilities for independent cascade model. In KES, 2008.
26. Y. Singer. How to win friends and influence people, truthfully: influence maximization mechanisms for social networks. In WSDM, 2012.
27. Y. Tang, X. Xiao, and Y. Shi. Influence maximization: Near-optimal time complexity meets practical efficiency. In SIGMOD, 2014.
28. 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.