Matrix Factorization (MF) is a well-known method which is to predict users’ preference in recommender systems. This method has the advantage of reducing data sparsity and cold start problem. Probabilistic matrix factorization (PMF) is an improved method of matrix factorization. Recommender system can efficiently reduce the information overload problem. However, it is bound by the recommended accuracy. In this paper we introduce Bayesian distribution to improve accuracy and design our novel probabilistic matrix factorization (NPMF) proved to have better performance. In addition, we also use K nearest neighbor method and stochastic gradient descent to further improve our method. The experimental studies using two different datasets including MovieLens 100k and MovieLens 1M, show that the proposed methods already have comparable and better performance.
[1]
Kevin Barraclough,et al.
I and i
,
2001,
BMJ : British Medical Journal.
[2]
Tao Jin,et al.
Collaborative topic regression for online recommender systems: an online and Bayesian approach
,
2017,
Machine Learning.
[3]
J. Bobadilla,et al.
Recommender systems survey
,
2013,
Knowl. Based Syst..
[4]
Danna Zhou,et al.
d.
,
1934,
Microbial pathogenesis.
[5]
Lan Chen,et al.
Knowle: A semantic link network based system for organizing large scale online news events
,
2015,
Future Gener. Comput. Syst..