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

TitleStatusHype
Solving Cold Start Problem in Recommendation with Attribute Graph Neural Networks—0
Bounded Manifold Completion—0
Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning—0
Balancing Accuracy and Diversity in Recommendations using Matrix Completion Framework—0
Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)Code1
Community Detection and Matrix Completion with Social and Item Similarity Graphs—0
Influenza Modeling Based on Massive Feature Engineering and International Flow Deconvolution—0
A Fast Matrix-Completion-Based Approach for Recommendation Systems—0
Provable Non-linear Inductive Matrix Completion—0
Matrix Completion using Kronecker Product Approximation—0
Spectral Geometric Matrix CompletionCode0
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery—0
Intelligent Reflecting Surface for Massive Device Connectivity: Joint Activity Detection and Channel Estimation—0
Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm AssumptionCode0
Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine LearningCode0
Bayesian Graph Convolutional Neural Networks Using Non-Parametric Graph Learning—0
Fast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion—0
Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift—0
Matrix Completion, Counterfactuals, and Factor Analysis of Missing Data—0
New and Explicit Constructions of Unbalanced Ramanujan Bipartite Graphs—0
The Sparse Reverse of Principal Component Analysis for Fast Low-Rank Matrix Completion—0
Deep geometric matrix completion: Are we doing it right?—0
Statistical Inferences of Linear Forms for Noisy Matrix Completion—0
Scalable Probabilistic Matrix Factorization with Graph-Based PriorsCode0
Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs: Exact and Stable Recovery—0
Show:102550
← PrevPage 15 of 32Next →

No leaderboard results yet.