SimRate: improve collaborative recommendation based on rating graph for sparsity

  • Authors:
  • Li Yu;Zhaoxin Shu;Xiaoping Yang

  • Affiliations:
  • School of Information, Renmin University of China, Beijing, P.R. China;School of Information, Renmin University of China, Beijing, P.R. China;School of Information, Renmin University of China, Beijing, P.R. China

  • Venue:
  • ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Collaborative filtering is a widely used recommending method. But its sparsity problem often happens and makes it defeat when rate data is too few to compute the similarity of users. Sparsity problem also could result into error recommendation. In this paper, the notion of SimRank is used to overcome the problem. Especially, a novel weighted SimRank for rate bi-partite graph, SimRate, is proposed to compute similarity between users and to determine the neighbor users. SimRate still work well for very sparse rate data. The experiments show that SimRate has advantage over state-of-the-art method.