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 671–680 of 796 papers

TitleStatusHype
Streaming, Memory Limited Matrix Completion with Noise—0
Structured Matrix Completion with Applications to Genomic Data Integration—0
Relaxed Leverage Sampling for Low-rank Matrix Completion—0
Online Matrix Completion and Online Robust PCA—0
Scalable Nuclear-norm Minimization by Subspace Pursuit Proximal Riemannian Gradient—0
A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion—0
Matrix Completion with Noisy Entries and Outliers—0
Low Rank Matrix Completion with Exponential Family Noise—0
1-Bit Matrix Completion under Exact Low-Rank Constraint—0
Exact tensor completion using t-SVD—0
Show:102550
← PrevPage 68 of 80Next →

No leaderboard results yet.