A SAEM algorithm for matrix completion problems
Keywords:
Matrix completion, EM algorithm, SAEM algorithm, collaborative filtering, principal components analysisAbstract
In this work we dealt with matrix completion problem. This problem arises in different fields, for example, systems and control theory, image processing and collaborative filtering. Given a probabilistic matrix factorization model, we present an approach based on Bayesian statistics and a stochastic expectation maximization algorithm to retrieve an array of data from a sample of its inputs. The proposed method does not require regularization parameters and estimates the rank of the matrix, in contrast to the BPMF method. The results show that the proposed method outperforms the rank of the matrix comparing to an augmented lagrangian algorithm and it is more efficient than the BPMF method.
Downloads
Published
How to Cite
Issue
Section
Creative Commons Reconocimiento-NoComercial-CompartirIgual 4.0 Internacional (CC BY-NC-SA 4.0)
The opinions expressed by the authors do not necessarily reflect the position of the publisher of the publication or of UCLA. The total or partial reproduction of the texts published here is authorized, as long as the complete source and the electronic address of this journal are cited.
The authors fully retain the rights to their works, giving the journal the right to be the first publication where the article is presented. The authors have the right to use their articles for any purpose as long as it is done for non-profit. Authors are recommended to disseminate their articles in the final version, after publication in this journal, in the electronic media of the institutions to which they are affiliated or personal digital media.
