Improving memory-based collaborative filtering via similarity updating and prediction modulation

被引:64
作者
Jeong, Buhwan [2 ]
Lee, Jaewook [1 ]
Cho, Hyunbo [1 ]
机构
[1] Pohang Univ Sci & Technol POSTECH, Dept Ind & Management Engn, Pohang 790784, South Korea
[2] Daum Commun Corp, Data Min Team, Cheju 690150, South Korea
关键词
Collaborative filtering; Mean absolute error (MAE); Message passing; Recommendation accuracy; Recommender system; Similarity measure; RECOMMENDER;
D O I
10.1016/j.ins.2009.10.016
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Memory-based collaborative filtering (CF) makes recommendations based on a collection of user preferences for items. The idea underlying this approach is that the interests of an active user will more likely coincide with those of users who share similar preferences to the active user. Hence, the choice and computation of a similarity measure between users is critical to rating items. This work proposes a similarity update method that uses an iterative message passing procedure. Additionally, this work deals with a drawback of using the popular mean absolute error (MAE) for performance evaluation, namely that ignores ratings distribution. A novel modulation method and an accuracy metric are presented in order to minimize the predictive accuracy error and to evenly distribute predicted ratings over true rating scales. Preliminary results show that the proposed similarity update and prediction modulation techniques significantly improve the predicted rankings. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:602 / 612
页数:11
相关论文
共 34 条
[1]   Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions [J].
Adomavicius, G ;
Tuzhilin, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) :734-749
[2]   A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem [J].
Ahn, Hyung Jun .
INFORMATION SCIENCES, 2008, 178 (01) :37-51
[3]  
[Anonymous], 2005, P 14 INT C WORLD WID, DOI DOI 10.1145/1060745.1060754
[4]  
[Anonymous], P 20 INT JOINT C ART
[5]  
[Anonymous], 2004, P 21 INT C MACHINE L
[6]  
[Anonymous], 2003, Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining
[7]  
Bishop C., 2006, PATTERN RECOGN, P359
[8]   Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation [J].
Fouss, Francois ;
Pirotte, Alain ;
Renders, Jean-Michel ;
Saerens, Marco .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (03) :355-369
[9]  
Frey Brendan., 2006, ADV NEURAL INFORM PR, P379
[10]   Clustering by passing messages between data points [J].
Frey, Brendan J. ;
Dueck, Delbert .
SCIENCE, 2007, 315 (5814) :972-976