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 591–600 of 796 papers

TitleStatusHype
Nearly-optimal Robust Matrix Completion—0
Link Prediction via Matrix Completion—0
Generalizing to Unseen Entities and Entity Pairs with Row-less Universal SchemaCode0
Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method—0
Extended Gauss-Newton and ADMM-Gauss-Newton Algorithms for Low-Rank Matrix Optimization—0
Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization—0
DeepHand: Robust Hand Pose Estimation by Completing a Matrix Imputed With Deep Features—0
Proximal Riemannian Pursuit for Large-Scale Trace-Norm Minimization—0
Contextual Bandits with Latent Confounders: An NMF Approach—0
Self-Adaptive Matrix Completion for Heart Rate Estimation From Face Videos Under Realistic Conditions—0
Show:102550
← PrevPage 60 of 80Next →

No leaderboard results yet.