Collaborative Filtering Based on Gaussian Mixture Model and Improved Jaccard Similarity

Abstract

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.INDEX TERMS Recommender systems, collaborative filtering, clustering, Gaussian mixture model, Jaccard similarity.

Application of adaptive moving object detection and edge calculation in Police Physical Education Training app course

“…The algorithm can adaptively select the number of Gaussian models, which reduces the calculation time and improves the segmentation accuracy. However, the arti cial introduction of negative prior coe cients will lead to the unstable weight update of Gaussian mixture, which will affect the accuracy of moving target detection [10]. Aiming at the problem that the classical Gaussian mixture algorithm is too sensitive to non-stationary scenes, an optimization method of Gaussian mixture model is proposed in the literature.…”

Augmenting Black Sheep Neighbour Importance for Enhancing Rating Prediction Accuracy in Collaborative Filtering

“…Ref. [49] clusters items and users by using a Gaussian mixture model and builds a new interaction matrix by extracting new item features that manages to solve the impact of rating data sparsity on CF algorithms. Furthermore, by combining the Jaccard and triangle similarities, it proposes a new similarity calculation algorithm.…”

User Preference and Reviews Analysis with Neural Networks for Travel Recommender Systems

“…The next and major step of the work is calculation of the similarity between user preference which obtained through the user interface of the recommendation application. The system uses combination of two types of similarity techniques namely Jaccard similarity index [7] and cosine similarity index [8] along with consideration of sentiment attributes [9] to match sentences with correct meaning.…”