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 226–250 of 796 papers

TitleStatusHype
Color Image Recovery Using Generalized Matrix Completion over Higher-Order Finite Dimensional Algebra—0
Bounded Manifold Completion—0
A Comparison of Clustering and Missing Data Methods for Health Sciences—0
Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method—0
Efficient Rigid Body Localization based on Euclidean Distance Matrix Completion for AGV Positioning under Harsh Environment—0
Empirical Bayes Matrix Completion—0
Energy-modified Leverage Sampling for Radio Map Construction via Matrix Completion—0
Enhancing Parameter-Free Frank Wolfe with an Extra Subproblem—0
Ensemble Methods for Causal Effects in Panel Data Settings—0
Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling—0
Entry-Specific Matrix Estimation under Arbitrary Sampling Patterns through the Lens of Network Flows—0
Errata: Distant Supervision for Relation Extraction with Matrix Completion—0
Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion—0
A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings—0
Color Image Inpainting via Robust Pure Quaternion Matrix Completion: Error Bound and Weighted Loss—0
Estimation of Missing Data in Intelligent Transportation System—0
Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent—0
Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent—0
Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion—0
A Novel Two-Step Method for Cross Language Representation Learning—0
Exact tensor completion with sum-of-squares—0
Exploiting Observation Bias to Improve Matrix Completion—0
Exploring Algorithmic Limits of Matrix Rank Minimization under Affine Constraints—0
Exponential Family Matrix Completion under Structural Constraints—0
1-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximation—0
Show:102550
← PrevPage 10 of 32Next →

No leaderboard results yet.