Improving accuracy and diversity of personalized recommendation through power law adjustments of user similarities

被引:51
作者
Gan, Mingxin [1 ]
Jiang, Rui [2 ]
机构
[1] Univ Sci & Technol Beijing, Dongling Sch Econ & Management, Beijing 100083, Peoples R China
[2] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Recommender systems; Collaborative filtering; Power law adjustment; Accuracy; Diversity; SYSTEMS;
D O I
10.1016/j.dss.2013.03.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recommender systems have become more and more indispensable in both commercial and research communities, due to the increasingly serious problem of information overload accompanying the rapid development of the internet technology in the recent years. As one of the dominant branches, collaborative filtering approaches base on similarities of user preferences in historical data have achieved remarkable successes in producing personalized recommendations. Nevertheless, the existence of popular objects may adversely influence the correct scoring of candidate objects and further yield unreasonable recommendation results. Meanwhile, it has been increasingly recognized that the gains of the recommendation accuracy are often accompanied by the losses of the diversity, yielding the accuracy-diversity dilemma for a personalized recommender system. In order to overcome these limitations while keeping a reasonable tradeoff between the accuracy and the diversity, we propose in this paper a method called PLUS (Power Law adjustments of User Similarities) to achieve personalized recommendations via the introduction of a power function to adjust user similarity scores, for the purpose of reducing adverse effects of popular objects in the user-based collaborative filtering framework. We perform a series of large scale validation experiments on two real data sets (MovieLens and Netflix) and compare the performance of our approach against that of an ordinary collaborative filtering method. Results show that our method outperforms the existing method not only in recommendation accuracy measured by the mean rank ratio and the recall enhancement, but also in recommendation diversity quantified by the mean personality and the mean novelty. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:811 / 821
页数:11
相关论文
共 29 条
[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]  
[Anonymous], GRAPH CLUSTERING FLO
[3]  
[Anonymous], 2008, P 14 ACM SIGKDD INT
[4]   A hybrid content-based and item-based collaborative filtering approach to recommend TV programs enhanced with singular value decomposition [J].
Belen Barragans-Martinez, Ana ;
Costa-Montenegro, Enrique ;
Burguillo, Juan C. ;
Rey-Lopez, Marta ;
Mikic-Fonte, Fernando A. ;
Peleteiro, Ana .
INFORMATION SCIENCES, 2010, 180 (22) :4290-4311
[5]  
Bennett J., 2007, SIGKDD Explor. Newsl., V9, P51
[6]   STATISTICAL ANALYSIS OF k-NEAREST NEIGHBOR COLLABORATIVE RECOMMENDATION [J].
Biau, Gerard ;
Cadre, Benoit ;
Rouviere, Laurent .
ANNALS OF STATISTICS, 2010, 38 (03) :1568-1592
[7]   Fusing Recommendations for Social Bookmarking Web Sites [J].
Bogers, Toine ;
van den Bosch, Antal .
INTERNATIONAL JOURNAL OF ELECTRONIC COMMERCE, 2011, 15 (03) :31-72
[8]   Hybrid recommender systems: Survey and experiments [J].
Burke, R .
USER MODELING AND USER-ADAPTED INTERACTION, 2002, 12 (04) :331-370
[9]   Comparison of Collaborative Filtering Algorithms: Limitations of Current Techniques and Proposals for Scalable, High-Performance Recommender Systems [J].
Cacheda, Fidel ;
Carneiro, Victor ;
Fernandez, Diego ;
Formoso, Vreixo .
ACM TRANSACTIONS ON THE WEB, 2011, 5 (01)
[10]   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