SOTAVerified

Matrix Completion

Matrix Completion is a method for recovering lost information. It originates from machine learning and usually deals with highly sparse matrices. Missing or unknown data is estimated using the low-rank matrix of the known data.

Source: A Fast Matrix-Completion-Based Approach for Recommendation Systems

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 311–320 of 796 papers

TitleStatusHype
Clustering of Nonnegative Data and an Application to Matrix Completion—0
Low-rank matrix recovery with non-quadratic loss: projected gradient method and regularity projection oracle—0
Column _2,0-norm regularized factorization model of low-rank matrix recovery and its computation—0
Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method—0
A Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Completion—0
Conservative Stochastic Optimization with Expectation Constraints—0
Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion—0
Autoencoder-based Graph Construction for Semi-supervised Learning—0
A regularized deep matrix factorized model of matrix completion for image restorationCode0
Compressed sensing of low-rank plus sparse matricesCode1
Show:102550
← PrevPage 32 of 80Next →

No leaderboard results yet.