Robust influence maximization

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

Volumn 13-17-August-2016, Issue , 2016, Pages 885-894

  He, Xinran ^a   Kempe, David ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; DATA MINING; HARDNESS; METHOD OF MOMENTS; OPTIMIZATION; SOCIAL NETWORKING (ONLINE); VIRTUAL REALITY;

BICRITERIA APPROXIMATION; COMPUTATIONAL SOCIAL SCIENCE; INFLUENCE FUNCTIONS; INFLUENCE MAXIMIZATIONS; NATURAL HEURISTICS; NETWORK ALGORITHMS; PARAMETER SETTING; STRONG APPROXIMATION;

PARAMETER ESTIMATION;

EID: 84984950081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2939672.2939760     Document Type: Conference Paper

References (35)

1. B. Abrahao, F. Chierichetti, R. Kleinberg, and A. Panconesi. Trace complexity of network inference. In Proc. 19th KDD, pages 491-499, 2013.
2. A. Adiga, C. J. Kuhlman, H. S. Mortveit, and A. K. S. Vullikanti. Sensitivity of diffusion dynamics to network uncertainty. In Proc. 28th AAAI, 2013.
3. C. Borgs, M. Brautbar, J. Chayes, and B. Lucier. Maximizing social inuence in nearly optimal time. In Proc. 25th ACM SODA, pages 946-957, 2014.
4. K. E. Campbell and B. A. Lee. Name generators in surveys of personal networks. Social Networks, 13(3):203-221, 1991.
5. W. Chen, L. V. Lakshmanan, and C. Castillo. Information and Inuence Propagation in Social Networks. Synthesis Lectures on Data Management. Morgan & Claypool, 2013.
6. W. Chen, T. Lin, Z. Tan, M. Zhao, and X. Zhou. Robust inuence maximization. In Proc. 22nd KDD, 2016.
7. W. Chen, Y. Wang, and S. Yang. Effcient inuence maximization in social networks. In Proc. 15th KDD, pages 199-208, 2009.
8. W. Chen, Y. Wang, Y. Yuan, and Q. Wang. Combinatorial multi-armed bandit and its extension to probabilistically triggered arms. J. Mach. Learn. Res. 17(1):1746-1778, 2016.
9. W. Chen, Y. Yuan, and L. Zhang. Scalable inuence maximization in social networks under the linear threshold model. In Proc. 10th ICDM, pages 88-97, 2010.
10. X. Chen, G. Song, X. He, and K. Xie. On inuential nodes tracking in dynamic social networks. In Proc. 15th SDM, pages 613-621, 2015.
11. H. Daneshmand, M. Gomez-Rodriguez, L. Song, and B. Scholkopf. Estimating diffusion network structures: Recovery conditions, sample complexity & soft-thresholding algorithm. In Proc. 31st ICML, 2014.
12. N. Du, Y. Liang, M.-F. Balcan, and L. Song. Inuence function learning in information diffusion networks. In Proc. 31st ICML, 2014.
13. N. Du, L. Song, M. Gomez-Rodriguez, and H. Zha. Scalable inuence estimation in continuous-time diffusion networks. In Proc. 25th NIPS, 2013.
14. M. Gomez-Rodriguez, D. Balduzzi, and B. Scholkopf. Uncovering the temporal dynamics of diffusion networks. In Proc. 28th ICML, pages 561-568, 2011.
15. M. Gomez-Rodriguez, J. Leskovec, and A. Krause. Inferring networks of diffusion and inuence. ACM Transactions on Knowledge Discovery from Data (TKDD), 5(4):21, 2012.
16. M. Gomez-Rodriguez and B. Scholkopf. Submodular inference of diffusion networks from multiple trees. In Proc. 29th ICML, 2012.
17. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. A data-based approach to social inuence maximization. Proc. VLDB Endowment, 5(1):73-84, 2011.
18. A. Goyal, F. Bonchi, L. V. S. Lakshmanan, and S. Venkatasubramanian. On minimizing budget and time in inuence propagation over social networks. Social Network Analysis and Mining, 3(2):179-192, 2013.
19. X. He and D. Kempe. Stability of inuence maximization. Unpublished Manuscript, available at http://arxiv.org/abs/1501. 04579, 2015.
20. X. He and D. Kempe. Robust inuence maximization. Technical Report, http://arxiv.org/abs/1602. 05240, 2016.
21. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of inuence in a social network. Theory of Computing, 11(4):105-147, 2015. A preliminary version of the results appeared in KDD 2003 and ICALP 2005.
22. S. Khanna and B. Lucier. Inuence maximization in undirected networks. In Proc. 25th ACM SODA, pages 1482-1496, 2014.
23. A. Krause, H. B. McMahan, C. Guestrin, and A. Gupta. Robust submodular observation selection. In Journal of Machine Learning Research, volume 9, pages 2761-2801, 2008.
24. S. Lei, S. Maniu, L. Mo, R. Cheng, and P. Senellart. Online inuence maximization. In Proc. 21st KDD, pages 645-654, 2015.
25. J. Leskovec, L. Backstrom, and J. Kleinberg. Meme-tracking and the dynamics of the news cycle. In Proc. 15th KDD, pages 497-506, 2009. Note: updated data sets at http://www. memetracker.org/.
26. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In Proc. 13th KDD, pages 420-429, 2007.
27. M. Lowalekar, P. Varakantham, and A. Kumar. Robust inuence maximization (extended abstract). In Proc. 15th AAMAS, pages 1395-1396, 2016.
28. E. Mossel and S. Roch. Submodularity of inuence in social networks: From local to global. SIAM J. Comput. 39(6):2176-2188, 2010.
29. S. A. Myers and J. Leskovec. On the convexity of latent social network inference. In Proc. 22nd NIPS, pages 1741-1749, 2010.
30. H. Narasimhan, D. C. Parkes, and Y. Singer. Learnability of inuence in networks. In Proc. 27th NIPS, pages 3168-3176, 2015.
31. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
32. P. Netrapalli and S. Sanghavi. Learning the graph of epidemic cascades. In ACM SIGMETRICS Performance Evaluation Review, pages 211-222, 2012.
33. K. Saito, M. Kimura, K. Ohara, and H. Motoda. Selecting information diffusion models over social networks for behavioral analysis. In Proc. 2010 European Conference on Machine Learning and Knowledge Discovery in Databases: Part III, ECML/PKDD 10, pages 180-195, 2010.
34. C. Wang, W. Chen, and Y. Wang. Scalable inuence maximization for independent cascade model in large-scale social networks. Data Mining and Knowledge Discovery Journal, 25(3):545-576, 2012.
35. Y. Wang, G. Cong, G. Song, and K. Xie. Community-based greedy algorithm for mining top-k inuential nodes in mobile social networks. In Proc. 16th KDD, pages 1039-1048, 2010.