A Zero-imputation Approach in Recommendation Systems with Data Missing Heterogeneously
From MaRDI portal
Cites work
- 1-bit matrix completion
- A simpler approach to matrix completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- Causal inference for statistics, social, and biomedical sciences. An introduction
- Exact matrix completion via convex optimization
- scientific article; zbMATH DE number 3780300 (Why is no real title available?)
- Inference and uncertainty quantification for noisy matrix completion
- Matrix completion from noisy entries
- Matrix Completion under Low-Rank Missing Mechanism
- Matrix estimation by universal singular value thresholding
- Network representation using graph root distributions
- Noisy low-rank matrix completion with general sampling distribution
- Random forests
- Representations for partially exchangeable arrays of random variables
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Smooth neighborhood recommender systems
- Spectral regularization algorithms for learning large incomplete matrices
- Statistical significance of the Netflix challenge
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
This page was built for publication: A Zero-imputation Approach in Recommendation Systems with Data Missing Heterogeneously
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185137)
