A similarity measure based on Kullback–Leibler divergence for collaborative filtering in sparse data. (October 2019)

• Record Type: Journal Article
• Authors: Deng, Jiangzhou; Wang, Yong; Guo, Junpeng; Deng, Yongheng; Gao, Jerry; Park, Younghee
• Is Part Of: Journal of information science. Volume 45:Number 5(2019)
• Page Start: 656
• Page End: 675
• Publication Date: 2019-10
• Subjects: Collaborative filtering -- neighbourhood-based CF -- recommendation algorithm -- similarity measure -- the Kullback–Leibler divergence; Information science -- Periodicals; Information science; Periodicals; 020.5
• DOI: 10.1177/0165551518808188
• Languages: English
• ISSNs: 0165-5515

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.