Link prediction in graphs with autoregressive features

In the paper, we consider the problem of link prediction in time-evolving graphs. We assume that certain graph features, such as the node degree, follow a vector autoregressive (VAR) model and we propose to use this information to improve the accuracy of prediction. Our strategy involves a joint optimization procedure over the space of adjacency matrices and VAR matrices which takes into account both sparsity and low rank properties of the matrices. Oracle inequalities are derived and illustrate the trade-offs in the choice of smoothing parameters when modeling the joint effect of sparsity and low rank property. The estimate is computed efficiently using proximal methods through a generalized forward-backward agorithm.

[1]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[2]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[3]  Purnamrita Sarkar,et al.  Nonparametric Link Prediction in Dynamic Networks , 2012, ICML.

[4]  Tommi S. Jaakkola,et al.  Maximum-Margin Matrix Factorization , 2004, NIPS.

[5]  Ruey S. Tsay,et al.  Analysis of Financial Time Series: Tsay/Analysis of Financial Time Series , 2005 .

[6]  Yurii Nesterov,et al.  Smooth minimization of non-smooth functions , 2005, Math. Program..

[7]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[8]  Andrea Montanari,et al.  The Noise-Sensitivity Phase Transition in Compressed Sensing , 2010, IEEE Transactions on Information Theory.

[9]  Mohamed-Jalal Fadili,et al.  A Generalized Forward-Backward Splitting , 2011, SIAM J. Imaging Sci..

[10]  P. Bickel,et al.  SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR , 2008, 0801.1095.

[11]  Ali Shojaie,et al.  Adaptive Thresholding for Reconstructing Regulatory Networks from Time-Course Gene Expression Data , 2012 .

[12]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[13]  V. Koltchinskii.  Sparsity in penalized empirical risk minimization , 2009 .

[14]  Francis R. Bach,et al.  A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization , 2008, J. Mach. Learn. Res..

[15]  Yehuda Koren,et al.  Factorization meets the neighborhood: a multifaceted collaborative filtering model , 2008, KDD.

[16]  Emmanuel J. Candès,et al.  The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.

[17]  S. Geer,et al.  On the conditions used to prove oracle results for the Lasso , 2009, 0910.0722.

[18]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[19]  Eric R. Ziegel,et al.  Analysis of Financial Time Series , 2002, Technometrics.

[20]  Charles A. Micchelli,et al.  Learning Multiple Tasks with Kernel Methods , 2005, J. Mach. Learn. Res..

[21]  Yehuda Koren,et al.  Collaborative filtering with temporal dynamics , 2009, KDD.

[22]  Purnamrita Sarkar,et al.  Theoretical Justification of Popular Link Prediction Heuristics , 2011, IJCAI.

[23]  Y. Nardi,et al.  Autoregressive process modeling via the Lasso procedure , 2008, J. Multivar. Anal..

[24]  E. Rogers.  Diffusion of Innovations , 1962 .

[25]  V. Koltchinskii,et al.  Nuclear norm penalization and optimal rates for noisy low rank matrix completion , 2010, 1011.6256.

[26]  Patrick L. Combettes,et al.  Proximal Splitting Methods in Signal Processing , 2009, Fixed-Point Algorithms for Inverse Problems in Science and Engineering.

[27]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[28]  Jure Leskovec,et al.  On the Convexity of Latent Social Network Inference , 2010, NIPS.

[29]  J. Friedman,et al.  Predicting Multivariate Responses in Multiple Linear Regression , 1997 .

[30]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

[31]  Nicolas Vayatis,et al.  Estimation of Simultaneously Sparse and Low Rank Matrices , 2012, ICML.

[32]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[33]  Zan Huang,et al.  The Time-Series Link Prediction Problem with Applications in Communication Surveillance , 2009, INFORMS J. Comput..

[34]  VayatisNicolas,et al.  Link prediction in graphs with autoregressive features , 2014 .

[35]  Ben Taskar,et al.  Link Prediction in Relational Data , 2003, NIPS.

[36]  Stéphane Gaïffas,et al.  Sharp Oracle Inequalities for High-Dimensional Matrix Prediction , 2011, IEEE Transactions on Information Theory.

[37]  Padhraic Smyth,et al.  Continuous-Time Regression Models for Longitudinal Networks , 2011, NIPS.

[38]  Charles A. Micchelli,et al.  A Spectral Regularization Framework for Multi-Task Structure Learning , 2007, NIPS.

[39]  A. Lewis.  The Convex Analysis of Unitarily Invariant Matrix Functions , 1995 .

[40]  V. Koltchinskii.  The Dantzig selector and sparsity oracle inequalities , 2009, 0909.0861.

[41]  Richard A. Davis,et al.  Sparse Vector Autoregressive Modeling , 2012, 1207.0520.

[42]  Theodoros Evgeniou,et al.  Content Contributor Management and Network Effects in a UGC Environment , 2012, Mark. Sci..

[43]  Larry A. Wasserman,et al.  Time varying undirected graphs , 2008, Machine Learning.

[44]  Theodoros Evgeniou,et al.  Link Discovery using Graph Feature Tracking , 2010, NIPS.