A similarity measure based on Kullback–Leibler divergence for collaborative filtering in sparse data

Abstract

In the neighbourhood-based collaborative filtering (CF) algorithms, a user similarity measure is used to find other users similar to an active user. Most of the existing user similarity measures rely on the co-rated items. However, there are not enough co-rated items in sparse dataset, which usually leads to poor prediction. In this article, a new similarity scheme is proposed, which breaks free of the constraint of the co-rated items. Moreover, an item similarity measure based on the Kullback–Leibler (KL) divergence is presented, which identifies the relation between items based on the probability density distribution of ratings. Since the item similarity based on KL divergence makes full use of all ratings, it owns better flexibility for sparse datasets. The CF algorithm using our proposed similarity scheme is implemented and compared with some classic CF algorithms. The compared results show that the CF using our similarity has better predictive performance. Therefore, our similarity scheme is a good solution for the sparsity problem and has great potential to be applied to recommendation systems.

Sea Clutter Amplitude Prediction Using a Long Short-Term Memory Neural Network

“…In order to visually analyze the ability of different prediction methods to detect targets, we calculate the Kullback-Leibler (KL) divergence [43] between the probability distribution of the mean amplitude and the probability distribution of the MSE of different prediction methods, KL divergence is as follows (Equation (12):…”

A note on predator-prey dynamics in radiocarbon datasets

“…The resulting KL divergence value is not a distance metric as it does not satisfy the triangle inequality and is asymmetric, meaning the divergence of p(x) from q(x) differs from the divergence of q(x) from p(x). The KL divergence is one of the most popular ways to compare probability distributions in information theory and data science, and has mathematical properties that make it uniquely suitable for measuring relative information (reviewed in Deng et al, 2019). KL divergence from the prey to the predator SPD was computed in each case using the `philentropy::KL` function from the 'philentropy' library (Drost, 2018).…”

A New Similarity Computing Model of Collaborative Filtering

“…Sahu A K et al apply item characters and user tags to matrix factorization, which solving data sparse problems with cross-domain recommender systems [33]. KLCF method [34]uses all user ratings to calculate similarity, and uses KL to calculate item similarity for weight adjustment, breaking the rule of using only common scoring items. Experiments show that this method can be applied to sparse matrices.…”