Normalized Matrix Factorization with Implicit FeedBack and Baseline Predictor

Abstract

The traditional matrix factorization algorithm has the problems of cold start, data sparsity and high predictive time complexity, which is not perfect in most recommendation systems. Especially in the sparse matrix problem, the recommendation accuracy cannot be guaranteed. This paper will be based on the matrix factorization algorithm modeling and create optimization algorithm, this method will be graded dataset preprocessing, the user and item's score matrix by embedding process at the same time and introducing BatchNorm sparse matrix algorithm for training normalization processing parameters do to speed up the convergence speed, increase the stability of the training, respectively add item bias that more able to show the user's true score, then the user matrix to join implicit feedback, the final score projections for the user. The optimization algorithm performs well in solving cold startup and data sparse problems of matrix factorization. The Results of the Movielens-1M experiment show that it has great advantages over traditional matrix factorization algorithms in terms of prediction accuracy, root mean square error and square absolute error.