Scalable diffusion-aware optimization of network topology

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

Volumn , Issue , 2014, Pages 1226-1235

  Khalil, Elias Boutros ^a   Dilkina, Bistra ^a   Song, Le ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

approximation; diffusion networks; network optimization; supermodularity

Indexed keywords

EID: 84907031423     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2623330.2623704     Document Type: Conference Paper

References (22)

1. I. Bogunovic. Robust protection of networks against cascading phenomena. Master's thesis, ETHZ, 2012.
2. U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2), 2001.
3. W. Chen, L. V. Lakshmanan, and C. Castillo. Information and influence propagation in social networks. Synthesis Lectures on Data Management, 2013.
4. W. Chen, Y. Yuan, and L. Zhang. Scalable influence maximization in social networks under the linear threshold model. In IEEE ICDM, pages 88-97, 2010.
5. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. Journal of Computer and System Sciences, 55(3):441-453, 1997.
6. P. Domingos and M. Richardson. Mining the network value of customers. In ACM KDD, pages 57-66, 2001.
7. N. Du, L. Song, H. Zha, and M. Gomez Rodriguez. Scalable influence estimation in continuous time diffusion networks. In NIPS, 2013.
8. C. Gao, J. Liu, and N. Zhong. Network immunization and virus propagation in email networks: experimental evaluation and analysis. KAIS, 27(2):253-279, 2011.
9. X. He, G. Song, W. Chen, and Q. Jiang. Influence blocking maximization in social networks under the competitive linear threshold model. In SDM, 2012.
10. H. W. Hethcote. The mathematics of infectious diseases. SIAM review, 42(4):599-653, 2000.
11. R. Iyer, S. Jegelka, and J. Bilmes. Fast semidifferential-based submodular function optimization. In ICML, 2013.
12. D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In ACM KDD, pages 137-146. ACM, 2003.
13. M. Kimura, K. Saito, and H. Motoda. Solving the contamination minimization problem on networks for the linear threshold model. In PRICAI. 2008.
14. M. Kimura, K. Saito, and H. Motoda. Blocking links to minimize contamination spread in a social network. ACM TKDD, 3(2):9, 2009.
15. C. J. Kuhlman, G. Tuli, S. Swarup, M. V. Marathe, and S. Ravi. Blocking simple and complex contagion by edge removal. In IEEE ICDM, 2013.
16. J. Leskovec, L. Backstrom, and J. Kleinberg. Memetracking and the dynamics of the news cycle. In ACM KDD, pages 497-506. ACM, 2009.
17. J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani. Kronecker graphs: An approach to modeling networks. 11(Feb):985-1042, 2010.
18. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14, 1978.
19. S. Peng, S. Yu, and A. Yang. Smartphone malware and its propagation modeling: A survey. IEEE Communications Surveys Tutorials, PP(99):1-17, 2013.
20. C. M. Schneider, T. Mihaljev, S. Havlin, and H. J. Herrmann. Suppressing epidemics with a limited amount of immunization units. Physical Review E, 84(6), 2011.
21. D. Sheldon, B. Dilkina, A. N. Elmachtoub, R. Finseth, et al. Maximizing the spread of cascades using network design. UAI, 2010.
22. H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos. Gelling, and melting, large graphs by edge manipulation. In ACM CIKM, 2012.