Link prediction in graphs with autoregressive features

Journal of Machine Learning Research

Volumn 15, Issue , 2014, Pages 565-593

  Richard, Emile ^a   Gaïffas, Stéphane ^b   Vayatis, Nicolas ^c  

^a Stanford University   (United States)

^b CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Autoregression; Graphs; Link prediction; Low rank; Sparsity

Indexed keywords

NUMERICAL METHODS; REGRESSION ANALYSIS; VALUE ENGINEERING;

AUTOREGRESSION; GRAPHS; LINK PREDICTION; LOW-RANK; SPARSITY;

FORECASTING;

EID: 84897046046     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (42)

1. J. Abernethy, F. Bach, T. Evgeniou, and J.-P. Vert. A new approach to collaborative filtering: Operator estimation with spectral regularization. Journal of Machine Learning Research, 10:803-826, 2009.
2. A. Andreas, M. Pontil, Y. Ying, and C. A. Micchelli. A spectral regularization framework for multi-task structure learning. In Advances in Neural Information Processing Systems (NIPS), pages 25-32, 2007.
3. A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal of Imaging Sciences, 2(1):183-202, 2009.
4. D. P. Bertsekas. Incremental gradient, subgradient, and proximal methods for convex optimization: a survey. Optimization for Machine Learning, page 85, 2011.
5. P. J. Bickel, Y. Ritov, and A. B. Tsybakov. Simultaneous analysis of lasso and Dantzig selector. Ann. Statist., 37(4):1705-1732, 2009.
6. L. Breiman and J. H. Friedman. Predicting multivariate responses in multiple linear regression. Journal of the Royal Statistical Society (JRSS): Series B (Statistical Methodology), 59:3-54, 1997. (Pubitemid 127686939)
7. E. J. Candès and T. Tao. Decoding by linear programming. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2005.
8. E. J. Candès and T. Tao. The power of convex relaxation: Near-optimal matrix completion. Information Theory, IEEE Transactions on, 56(5), 2009.
9. E. J. Candès and M. Wakin. An introduction to compressive sampling. IEEE Signal Processing Magazine, 12(51):21-30, 2008.
10. P. L. Combettes and J. C. Pesquet. Proximal splitting methods in signal processing. Fixed- Point Algorithms for Inverse Problems in Science and Engineering, pages 185-212, 2011.
11. R. A. Davis, P. Zang, and T. Zheng. Sparse vector autoregressive modeling. arXiv preprint arXiv:1207.0520, 2012.
12. D. L. Donoho. Compressed sensing. Information Theory, IEEE Transactions on, 52(4): 1289-1306, 2006.
13. T. Evgeniou, C. A. Micchelli, and M. Pontil. Learning multiple tasks with kernel methods. Journal of Machine Learning Research, 6:615-637, 2005.
14. S. Gaïffas and G. Lecué. Sharp oracle inequalities for high-dimensional matrix prediction. Information Theory, IEEE Transactions on, 57(10):6942 -6957, oct. 2011.
15. Z. Huang and D. K. J. Lin. The time-series link prediction problem with applications in communication surveillance. INFORMS J. on Computing, 21(2):286-303, 2009.
16. M. Kolar and E. P. Xing. On time varying undirected graphs. In International Conference on Artificial Intelligence and Statistics, pages 407-415, 2011.
17. V. Koltchinskii. Sparsity in penalized empirical risk minimization. Ann. Inst. Henri Poincaré Probab. Stat., 45(1):7-57, 2009a.
18. V. Koltchinskii. The Dantzig selector and sparsity oracle inequalities. Bernoulli, 15(3): 799-828, 2009b.
19. V. Koltchinskii, K. Lounici, and A. B. Tsybakov. Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. Ann. Statist., 39(5):2302-2329, 2011.
20. Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 426-434. ACM, 2008.
21. Y. Koren. Collaborative filtering with temporal dynamics. Communications of the ACM, 53(4):89-97, 2010.
22. A. S. Lewis. The convex analysis of unitarily invariant matrix functions. J. Convex Anal., 2(1-2):173-183, 1995.
23. D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7):1019-1031, 2007. (Pubitemid 46830394)
24. L. Lü and T. Zhou. Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications, 390(6):1150-1170, 2011.
25. S. A. Myers and J. Leskovec. On the convexity of latent social network inference. In Advances in Neural Information Processing Systems (NIPS), 2010.
26. Y. Nardi and A. Rinaldo. Autoregressive process modeling via the lasso procedure. Journal of Multivariate Analysis, 102(3):528-549, 2011.
27. Y. Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 103(1):127-152, 2005. (Pubitemid 40537674)
28. E. Richard, N. Baskiotis, T. Evgeniou, and N. Vayatis. Link discovery using graph feature tracking. In Advances in Neural Information Processing Systems (NIPS), 2010.
29. E. Richard, S. Gaiffas, and N. Vayatis. Link prediction in graphs with autoregressive features. In Advances in Neural Information Processing Systems (NIPS), 2012a.
30. E. Richard, P.-A. Savalle, and N. Vayatis. Estimation of simultaneously sparse and low-rank matrices. In Proceedings of 29th Annual International Conference on Machine Learning, 2012b.
31. E. M. Rogers. Diffusion of Innovations. London: The Free Press, 1962.
32. P. Sarkar, D. Chakrabarti, and A. W. Moore. Theoretical justification of popular link prediction heuristics. In International Conference on Learning Theory (COLT), pages 295-307, 2010.
33. P. Sarkar, D. Chakrabarti, and M. I. Jordan. Nonparametric link prediction in dynamic networks. In Proceedings of 29th Annual International Conference on Machine Learning, 2012.
34. A. Shojaie, S. Basu, and G. Michailidis. Adaptive thresholding for reconstructing regulatory networks from time course gene expression data. Statistics In Biosciences, 2011.
35. N. Srebro, J. D. M. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. In Advances in Neural Information Processing Systems (NIPS). 2005.
36. B. Taskar, M. F. Wong, P. Abbeel, and D. Koller. Link prediction in relational data. In Advances in Neural Information Processing Systems (NIPS), 2003.
37. J. A. Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389-434, 2012.
38. R. S. Tsay. Analysis of Financial Time Series. Wiley-Interscience; 3rd edition, 2005.
39. P. Tseng. On accelerated proximal gradient methods for convex-concave optimization. Preprint, 2008.
40. S. A. van de Geer and P. Bühlmann. On the conditions used to prove oracle results for the Lasso. Electron. J. Stat., 3:1360-1392, 2009.
41. D. Q. Vu, A. Asuncion, D. Hunter, and P. Smyth. Continuous-time regression models for longitudinal networks. In Advances in Neural Information Processing Systems (NIPS), 2011.
42. K. Zhang, T. Evgeniou, V. Padmanabhan, and E. Richard. Content contributor management and network effects in a ugc environment. Marketing Science, 2011.