Analysis and Research on Increased Probability Matrix Factorization Techniques in Collaborative Filtering

Abstract

The matrix factorization algorithms such as the matrix factorization technique (MF), singular value decomposition (SVD) and the probability matrix factorization (PMF) and so on, are summarized and compared. Based on the above research work, a kind of improved probability matrix factorization algorithm called MPMF is proposed in this paper. MPMF determines the optimal value of dimension D of both the user feature vector and the item feature vector through experiments. The complexity of the algorithm scales linearly with the number of observations, which can be applied to massive data and has very good scalability. Experimental results show that MPMF can not only achieve higher recommendation accuracy, but also improve the efficiency of the algorithm in sparse and unbalanced data sets compared with other related algorithms.