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 691–700 of 796 papers

TitleStatusHype
Probabilistic low-rank matrix completion on finite alphabets—0
Consistent Collective Matrix Completion under Joint Low Rank Structure—0
Spectral k-Support Norm Regularization—0
Deterministic Symmetric Positive Semidefinite Matrix Completion—0
Online Optimization for Max-Norm Regularization—0
Guaranteed Matrix Completion via Non-convex Factorization—0
Signal Recovery on Graphs: Variation Minimization—0
Characterization of the equivalence of robustification and regularization in linear and matrix regression—0
PU Learning for Matrix Completion—0
Maximum Entropy Kernels for System Identification—0
Show:102550
← PrevPage 70 of 80Next →

No leaderboard results yet.