Scalable collaborative filtering using cluster-based smoothing
Lists
Only you see this
Abstract
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 approach has been shown to suffer from two fundamental problems: data sparsity and difficulty in scalability. Alternatively, the model-based approach has been proposed to alleviate these problems, but this approach tends to limit the range of users. In this paper, we present a novel approach that combines the advantages of these two 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-art collaborative filtering algorithms.
BibTeX
@inproceedings{xue2005scalable,
author = {Gui-Rong Xue and Chenxi Lin and Qiang Yang and Wensi Xi and Hua-Jun Zeng and Yong Yu and Zheng Chen},
title = {{Scalable collaborative filtering using cluster-based smoothing}},
booktitle = {International ACM SIGIR Conference on Research and Development in Information Retrieval},
year = {2005},
url = {https://openreview.net/forum?id=HkWNxIb_-B},
}Loading related content...