Scalable Collaborative Filtering Using Cluster-based Smoothing

  • Gui-Rong Xue
  • Chenxi Lin
  • Qiang Yang
  • Wensi Xi
  • Hua-Jun Zeng
  • Yong Yu
  • Zheng Chen

SIGIR '05 Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval |

Published by Association for Computing Machinery, Inc.

View Publication

Memory-based approaches for collaborative filtering identify the similarity between two users by comparing their ratings on a set of items. In the past, the memory-based approaches have been shown to suffer from two fundamental problems: data sparsity and difficulty in scalability. Alternatively, the model-based approaches have been proposed to alleviate these problems, but these approaches tends to limit the range of users. In this paper, we present a novel approach that combines the advantages of these two kinds of approaches by introducing a smoothing-based method. In our approach, clusters generated from the training data provide the basis for data smoothing and neighborhood selection. As a result, we provide higher accuracy as well as increased efficiency in recommendations. Empirical studies on two datasets (EachMovie and MovieLens) show that our new proposed approach consistently outperforms other state-of-the-art collaborative filtering algorithms.