期刊
APPLIED INTELLIGENCE
卷 51, 期 7, 页码 5132-5145出版社
SPRINGER
DOI: 10.1007/s10489-020-02049-9
关键词
Recommender system (RS); Collaborative filtering (CF); Variational autoencoder (VAE); Variational autoencoder Bayesian matrix factorization (VABMF)
资金
- National Natural Science Foundation of China [Z201G10110G20003]
Probabilistic matrix factorization (PMF) is a popular method for addressing the sparsity problem in collaborative filtering, but is vulnerable to overfitting. Bayesian PMF suggests an alternative approach, but comes with a high computational cost.
Probabilistic matrix factorization (PMF) is the most popular method among low-rank matrix approximation approaches that address the sparsity problem in collaborative filtering for recommender systems. PMF depends on the classical maximum a posteriori estimator for estimating model parameters; however, these approaches are vulnerable to overfitting because of the nature of a single point estimation that is pursued by these models. An alternative approach to PMF is a Bayesian PMF model that suggests the Markov chain Monte Carlo algorithm as a full estimation for approximate intractable posterior over model parameters. However, despite its success in increasing prediction, it has a high computational cost. To this end, we proposed a novel Bayesian deep learning-based model treatment, namely, variational autoencoder Bayesian matrix factorization (VABMF). The proposed model uses stochastic gradient variational Bayes to estimate intractable posteriors and expectation-maximization-style estimators to learn model parameters. The model was evaluated on the basis of three MovieLens datasets, namely, Ml-100k, Ml-1M, and Ml-10M. Experimental results showed that our proposed VABMF model significantly outperforms state-of-the-art RS.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据