Boosting collaborative filtering based on statistical prediction errors

  • Authors:
  • Shengchao Ding;Shiwan Zhao;Quan Yuan;Xiatian Zhang;Rongyao Fu;Lawrence Bergman

  • Affiliations:
  • Chinese Academy of Sciences, Beijing, China;IBM China Research Laboratory, Beijing, China;IBM China Research Laboratory, Beijing, China;IBM China Research Laboratory, Beijing, China;IBM China Research Laboratory, Beijing, China;IBM T.J. Watson Research Center, Hawthorne, NY, USA

  • Venue:
  • Proceedings of the 2008 ACM conference on Recommender systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

User-based collaborative filtering methods typically predict a user's item ratings as a weighted average of the ratings given by similar users, where the weight is proportional to the user similarity. Therefore, the accuracy of user similarity is the key to the success of the recommendation, both for selecting neighborhoods and computing predictions. However, the computed similarities between users are somewhat inaccurate due to data sparsity. For a given user, the set of neighbors selected for predicting ratings on different items typically exhibit overlap. Thus, error terms contributing to rating predictions will tend to be shared, leading to correlation of the prediction errors. Through a set of case studies, we discovered that for a given user, the prediction errors on different items are correlated to the similarities of the corresponding items, and to the degree to which they share common neighbors. We propose a framework to improve prediction accuracy based on these statistical prediction errors. Two different strategies to estimate the prediction error on a desired item are proposed. Our experiments show that these approaches improve the prediction accuracy of standard user based methods significantly, and they outperform other state-of-the-art methods.