Article thumbnail
Location of Repository

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

By Youngki Park, Sungchan Park, Woosung Jung and Sang-goo Lee

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.OAIID:oai:osos.snu.ac.kr:snu2015-01/102/0000003610/3ADJUST_YN:YEMP_ID:A003301DEPT_CD:4190CITE_RATE:2.24DEPT_NM:컴퓨터공학부SCOPUS_YN:YCONFIRM:

Topics: Reversed CF, Collaborative filtering, k-Nearest neighbor graph, Greedy filtering
Publisher: Elsevier
Year: 2015
DOI identifier: 10.1016/j.eswa.2015.01.001
OAI identifier: oai:s-space.snu.ac.kr:10371/95428
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10371/95... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.