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 391–400 of 796 papers

TitleStatusHype
Implicit Regularization in Deep Matrix FactorizationCode0
Spectral Perturbation Meets Incomplete Multi-view Data—0
Sum-of-squares meets square loss: Fast rates for agnostic tensor completion—0
Matrix Completion in the Unit Hypercube via Structured Matrix FactorizationCode0
STAR-GCN: Stacked and Reconstructed Graph Convolutional Networks for Recommender SystemsCode0
Collaborative Self-Attention for Recommender Systems—0
Prediction with Unpredictable Feature Evolution—0
Inductive Matrix Completion Based on Graph Neural NetworksCode1
Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers—0
Adaptive Matrix Completion for the Users and the Items in TailCode0
Show:102550
← PrevPage 40 of 80Next →

No leaderboard results yet.