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 741–750 of 796 papers

TitleStatusHype
Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion—0
Speedup Matrix Completion with Side Information: Application to Multi-Label Learning—0
Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms—0
Learning Mixtures of Discrete Product Distributions using Spectral Decompositions—0
The Noisy Power Method: A Meta Algorithm with Applications—0
Identifying Influential Entries in a Matrix—0
Unsupervised Spectral Learning of WCFG as Low-rank Matrix Completion—0
Incoherence-Optimal Matrix Completion—0
Online Algorithms for Factorization-Based Structure from Motion—0
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion—0
Show:102550
← PrevPage 75 of 80Next →

No leaderboard results yet.