Matrix completion by deep matrix factorization

Jicong Fan

doi:10.1016/j.neunet.2017.10.007

Return

Matrix completion by deep matrix factorization

2018-02-01

147

PRE

Jicong Fan *

Jieyu Cheng

DOI：10.1016/j.neunet.2017.10.007

Original

Original request for help

Save

Abstract

En 中文

Conventional methods of matrix completion are linear methods that are not effective in handling data of nonlinear structures. Recently a few researchers attempted to incorporate nonlinear techniques into matrix completion but there still exists considerable limitations. In this paper, a novel method called deep matrix factorization (DMF) is proposed for nonlinear matrix completion. Different from conventional matrix completion methods that are based on linear latent variable models, DMF is on the basis of a nonlinear latent variable model. DMF is formulated as a deep-structure neural network, in which the inputs are the low-dimensional unknown latent variables and the outputs are the partially observed variables. In DMF, the inputs and the parameters of the multilayer neural network are simultaneously optimized to minimize the reconstruction errors for the observed entries. Then the missing entries can be readily recovered by propagating the latent variables to the output layer. DMF is compared with state-of-the-art methods of linear and nonlinear matrix completion in the tasks of toy matrix completion, image inpainting and collaborative filtering. The experimental results verify that DMF is able to provide higher matrix completion accuracy than existing methods do and DMF is applicable to large matrices. (C) 2017 Elsevier Ltd. All rights reserved.

Keywords:

Matrix completion

Matrix factorization

Deep learning

Image inpainting

Collaborative filtering

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.