Return
Self-Supervised Feature Specific Neural Matrix Completion
DOI:10.1109/ACCESS.2020.3035120.png)
Abstract
En 中文
Unsupervised matrix completion algorithms mostly model the data generation process by using linear latent variable models. Recently proposed algorithms introduce non-linearity via multi-layer perceptrons (MLP), and self-supervision by setting separate linear regression frameworks for each feature to estimate the missing values. In this article, we introduce an MLP based algorithm called feature-specific neural matrix completion (FSNMC), which combines self-supervised and non-linear methods. The model parameters are estimated by a rotational scheme which separates the parameter and missing value updates sequentially with additional heuristic steps to prevent over-fitting and speed up convergence. The proposed algorithm specifically targets small to medium sized datasets. Experimental results on real-world and synthetic datasets varying in size with a range of missing value percentages demonstrate the superior accuracy for FSNMC, especially at low sparsities when compared to popular methods in the literature. The proposed method has particular potential in estimating missing data collected via real experimentation in fundamental life sciences.
Keywords:
Matrix completion
non-linear regression
neural networks
self-supervised learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
Rank adaptive atomic decomposition for low-rank matrix completion and its application on image recovery
NEUROCOMPUTING
IF6.5
A probabilistic framework to incorporate mixed-data type features: Matrix factorization with multimodal side information
NEUROCOMPUTING
IF6.5
Towards better accuracy for missing value estimation of epistatic miniarray profiling data by a novel ensemble approach
GENOMICS
IF3


