Collaborative Filtering Based on Gaussian Mixture Model and Improved Jaccard Similarity

The recommender systems play an important role in our lives, since it can quickly help users find what they are interested in. Collaborative filtering has become one of the most widely used algorithms in recommender systems due to its simplicity and efficiency. However, when the user's rating data is sparse, the accuracy of the collaborative filtering algorithm for predictive rating is badly reduced. In addition, the similarity calculation method is another important factor that affects the accuracy of the collaborative filtering algorithm recommendation. Faced with these problems, we propose a new collaborative filtering algorithm which based on Gaussian mixture model and improved Jaccard similarity. The proposed model uses Gaussian mixture model to cluster users and items respectively and extracts new features to build a new interaction matrix, which effectively solves the impact of rating data sparsity on collaborative filtering algorithms. Meanwhile, a new similarity calculation method is proposed, which is combined by triangle similarity and Jaccard similarity. Compare our proposed model with four models based on collaborative filtering algorithms on three public datasets. The experimental results show that the proposed model not only mitigates the sparseness of the data, but also improves the accuracy of the rating prediction.