Weighted Similarity Schemes for High Scalability in User-Based Collaborative Filtering
Mobile Networks and Applications(2014)
摘要
Similarity-based algorithms, often referred to as memory-based collaborative filtering techniques, are one of the most successful methods in recommendation systems. When explicit ratings are available, similarity is usually defined using similarity functions, such as the Pearson correlation coefficient, cosine similarity or mean square difference. These metrics assume similarity is a symmetric criterion. Therefore, two users have equal impact on each other in recommending new items. In this paper, we introduce new weighting schemes that allow us to consider new features in finding similarities between users. These weighting schemes, first, transform symmetric similarity to asymmetric similarity by considering the number of ratings given by users on non-common items. Second, they take into account the habit effects of users are regarded on rating items by measuring the proximity of the number of repetitions for each rate on common rated items. Experiments on two datasets were implemented and compared to other similarity measures. The results show that adding weighted schemes to traditional similarity measures significantly improve the results obtained from traditional similarity measures.
更多查看译文
关键词
Asymmetric similarity,Collaborative filtering,Recommender systems,User similarity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络