Influence function learning in information diffusion networks

31st International Conference on Machine Learning, ICML 2014

Volumn 5, Issue , 2014, Pages 4118-4135

  Du, Nan ^a   Liang, Yingyu ^a   Balcan, Maria Fiorina ^a   Song, Le ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; MAXIMUM LIKELIHOOD; METHOD OF MOMENTS; SUBSIDENCE;

BASIS FUNCTIONS; CONVEX COMBINATIONS; DIFFUSION MODEL; EMPIRICAL ANALYSIS; INFLUENCE FUNCTIONS; INFORMATION DIFFUSION; SAMPLE COMPLEXITY; TWO-STAGE APPROACHES;

COMPLEX NETWORKS;

EID: 84919793381     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Badanidiyuru, A., Dobzinski, S., Fu, H., Kleinberg, R. D., Nisan, N., and Roughgarden, T. Sketching valuation functions. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2012.
2. Balcan, Maria-Fiorina and Harvey, Nicholas JA. Learning submodular functions. In Proceedings of the 43rd annual ACM symposium on Theory of computing, pp. 793-802. ACM, 2011.
3. Birge, L. and Massart, P. Minimum Contrast Estimators on Sieves: Exponential Bounds and Rates of Convergence. Bernoulli, 4(3), 1998.
4. Bishop, Christopher. Pattern Recognition and Machine Learning. Springer, 2006.
5. Borgs, Christian, Brautbar, Michael, Chayes, Jennifer, and Lucier, Brendan. Influence maximization in social networks: Towards an optimal algorithmic solution. arXiv preprint arXiv:1212.0884, 2012.
6. Chen, Wei, Wang, Chi, and Wang, Yajun. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 1029-1038. ACM, 2010.
7. Du, N., Song, L., Smola, A., and Yuan, M. Learning networks of heterogeneous influence. In Advances in Neural Information Processing Systems 25, pp. 2789-2797, 2012.
8. Du, N., Song, L., Woo, H., and Zha, H. Uncover topic-sensitive information diffusion networks. In Artificial Intelligence and Statistics (AISTATS), 2013a.
9. Du, Nan, Song, Le, Rodriguez, Manuel Gomez, and Zha, Hongyuan. Scalable influence estimation in continuous-time diffusion networks. In Advances in Neural Information Processing Systems 26, 2013b.
10. Feldman, Vitaly and Kothari, Pravesh. Learning coverage functions. arXiv preprint arXiv: 1304.2079, 2013.
11. Feldman, Vitaly and Vondrak, Jan. Optimal bounds on approximation of submodular and xos functions by juntas. InFOCS, 2013.
12. Gomez Rodriguez, Manuel, Balduzzi, David, and Schölkopf, Bernhard. Uncovering the temporal dynamics of diffusion networks. arXiv preprint arXiv: 1105.0697, 2011.
13. Kempe, David, Kleinberg, Jon, and Tardos, Eva. Maximizing the spread of influence through a social network. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 137-146. ACM, 2003.
14. Kivinen, J. and Warmuth, M. K. Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1):1-64, January 1997.
15. Lafferty, J. D., McCallum, A., and Pereira, F. Conditional random fields: Probabilistic modeling for segmenting and labeling sequence data. In Proceedings of International Conference on Machine Learning, volume 18, pp. 282-289, San Francisco, CA, 2001. Morgan Kaufmann.
16. Leskovec, Jure, Backstrom, Lars, and Kleinberg, Jon. Meme-tracking and the dynamics of the news cycle. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 497-506. ACM, 2009.
17. Leskovec, Jure, Chakrabarti, Deepayan, Kleinberg, Jon, Faloutsos, Christos, and Ghahramani, Zoubin. Kro-necker graphs: An approach to modeling networks. Journal of Machine Learning Research, ll(Feb):985-1042, 2010.
18. Nemhauser, G., Wolsey, L., and Fisher, M. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
19. Netrapalli, Praneeth and Sanghavi, Sujay. Learning the graph of epidemic cascades. In SIGMET-RICS/PERFORMANCE, pp. 211-222. ACM, 2012. ISBN 978-1-4503-1097-0.
20. Rahimi, Ali and Recht, Benjamin. Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning. In Advances in neural information processing systems, pp. 1313-1320, 2008.
21. Rodriguez, M.G. and Schölkopf, B. Influence maximization in continuous time diffusion networks. In Proceedings of the International Conference on Machine Learning, 2012.
22. Schmidt, M., van den Berg, E., Friedlander, M. P., and Murphy, K. Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm. In van Dyk, D. and Welling, M. (eds.), Proceedings of The Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS) 2009, volume 5, pp. 456-463, Clearwater Beach, Florida, April 2009.
23. Wainwright, M. J. and Jordan, M. I. Graphical models, exponential families, and variational inference. Technical Report 649, UC Berkeley, Department of Statistics, September 2003.