Robust Recommendation via Social Network Enhanced Matrix Completion

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A limit theorem for scaled eigenvectors of random dot product graphs
Spectra of edge-independent random graphs
Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
Limit theorems for eigenvectors of the normalized Laplacian for random graphs
Robust low-rank matrix estimation
Generalized high-dimensional trace regression via nuclear norm regularization
Consistency of spectral clustering in stochastic block models
Noisy low-rank matrix completion with general sampling distribution
Eigenvalue Ratio Test for the Number of Factors
A Singular Value Thresholding Algorithm for Matrix Completion
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Inference and missing data
Asymptotic properties of the maximum-likelihood estimator in zero-inflated binomial regression
A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
Zero‐Inflated Poisson and Binomial Regression with Random Effects: A Case Study
Matrix Completion under Low-Rank Missing Mechanism
Matrix Completion With Covariate Information
Regularization and Variable Selection Via the Elastic Net
A Simpler Approach to Matrix Completion
Statistical significance of the Netflix challenge

This page was built for publication: Robust Recommendation via Social Network Enhanced Matrix Completion