COUSIN: A network-based regression model for personalized recommendations

被引:22
作者
Gan, Mingxin [1 ,2 ]
机构
[1] Univ Sci & Technol Beijing, Dept Management Sci & Engn, Donlinks Sch Econ & Management, Beijing 100083, Peoples R China
[2] Univ Calif Berkeley, Dept Stat, Berkeley, CA 94720 USA
关键词
Recommender systems; Network-based regression; Accuracy; Diversity; OF-THE-ART; SYSTEMS; DIVERSITY; ACCURACY;
D O I
10.1016/j.dss.2015.12.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, such state-of-the-art methods as collaborative filtering, content-based, model-based and graph-based approaches have achieved remarkable success in recommendations. However, most of them make recommendations based on either information from users or objects, or bipartite relationships between them, without explicitly exploring object, user and object-user relationships simultaneously. Meanwhile, recent discoveries in sociology and behavior science have demonstrated that similar users tend to select similar objects, usually referred to the n-degree of influence. However, such understandings have not been systematically incorporated into recommendations yet. With these understandings, we propose a novel method named COUSIN (Correlating Object and User Similarity profiles to personalized recommendatioN), adopting a regression model to incorporate object, user and object-user associations simultaneously in a global way for personalized recommendation. We also construct a power-law adjusted heterogeneous network for COUSIN to prevent adversely influence of popular nodes. We demonstrate the effectiveness of our method through comprehensive cross-validation experiments across two data sets (MovieLens and Netflix). Results show that our method outperforms the state-of-the-art methods in both accuracy and diversity performance, indicating its promising future for recommendation. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:58 / 68
页数:11
相关论文
共 42 条
[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], P 6 ACM C REC SYST R
[3]  
[Anonymous], 2001, WWW, DOI 10.1145/371920.372071
[4]  
[Anonymous], 2008, Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, DOI [DOI 10.1145/1401890.1401897, 10.1145/1401890.1401897]
[5]  
Backstrom L., 2011, P 4 ACM INT C WEB SE, P635, DOI DOI 10.1145/1935826.1935914
[6]   Fab: Content-based, collaborative recommendation [J].
Balabanovic, M ;
Shoham, Y .
COMMUNICATIONS OF THE ACM, 1997, 40 (03) :66-72
[7]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[8]   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
[9]   STATISTICAL ANALYSIS OF k-NEAREST NEIGHBOR COLLABORATIVE RECOMMENDATION [J].
Biau, Gerard ;
Cadre, Benoit ;
Rouviere, Laurent .
ANNALS OF STATISTICS, 2010, 38 (03) :1568-1592
[10]   Fusing Recommendations for Social Bookmarking Web Sites [J].
Bogers, Toine ;
van den Bosch, Antal .
INTERNATIONAL JOURNAL OF ELECTRONIC COMMERCE, 2011, 15 (03) :31-72