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

Showing 131140 of 796 papers

TitleStatusHype
Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale DatasetCode0
DeepVir -- Graphical Deep Matrix Factorization for "In Silico" Antiviral Repositioning: Application to COVID-19Code0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
Spectral Geometric Matrix CompletionCode0
Collective Matrix CompletionCode0
Adaptive Matrix Completion for the Users and the Items in TailCode0
A Perturbation Bound on the Subspace Estimator from Canonical ProjectionsCode0
Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form SolutionCode0
A Gradient Descent Algorithm on the Grassman Manifold for Matrix CompletionCode0
Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR SamplingCode0
Show:102550
← PrevPage 14 of 80Next →

No leaderboard results yet.