Publications

Detailed Information

Reversed CF: A fast collaborative filtering algorithm using a k-nearest neighbor graph

Cited 68 time in Web of Science Cited 95 time in Scopus
Authors

Park, Youngki; Park, Sungchan; Jung, Woosung; Lee, Sang-goo

Issue Date
2015-05
Publisher
Pergamon Press Ltd.
Citation
Expert Systems with Applications, Vol.42 No.8, pp.4022-4028
Abstract
User-based and item-based collaborative filtering (CF) methods are two of the most widely used techniques in recommender systems. While these algorithms are widely used in both industry and academia owing to their simplicity and acceptable level of accuracy, they require a considerable amount of time in finding top-k similar neighbors (items or users) to predict user preferences of unrated items. In this paper, we present Reversed CF (RCF), a rapid CF algorithm which utilizes a k-nearest neighbor (k-NN) graph. One main idea of this approach is to reverse the process of finding k neighbors; instead of finding k similar neighbors of unrated items. RCF finds the k-nearest neighbors of rated items. Not only does this algorithm perform fewer predictions while filtering out inaccurate results, but it also enables the use of fast k-NN graph construction algorithms. The experimental results show that our approach outperforms traditional user-based/item-based CF algorithms in terms of both preprocessing time and query processing time without sacrificing the level of accuracy. (C) 2015 Elsevier Ltd. All rights reserved.
ISSN
0957-4174
Language
English
URI
https://hdl.handle.net/10371/95428
DOI
https://doi.org/10.1016/j.eswa.2015.01.001
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share