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 351–360 of 796 papers

TitleStatusHype
Influenza Modeling Based on Massive Feature Engineering and International Flow Deconvolution—0
Information-theoretic Bounds on Matrix Completion under Union of Subspaces Model—0
Intelligent Reflecting Surface for Massive Device Connectivity: Joint Activity Detection and Channel Estimation—0
Decentralized Singular Value Decomposition for Large-scale Distributed Sensor Networks—0
Interpretable Matrix Completion: A Discrete Optimization Approach—0
Introducing the Huber mechanism for differentially private low-rank matrix completion—0
Iterative missing value imputation based on feature importance—0
Joint Matrix Completion and Compressed Sensing for State Estimation in Low-observable Distribution System—0
Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev—0
Clustering of Nonnegative Data and an Application to Matrix Completion—0
Show:102550
← PrevPage 36 of 80Next →

No leaderboard results yet.