Group Bayesian personalized ranking with rich interactions for one-class collaborative filtering

被引:26
作者
Pan, Weike [1 ,2 ]
Chen, Li [2 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China
[2] Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
关键词
One-class collaborative filtering; Implicit feedback; Group pairwise preference; Item set; RECOMMENDER SYSTEMS;
D O I
10.1016/j.neucom.2016.05.019
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Both researchers and practitioners in the field of collaborative filtering have shown keen interest to user behaviors of the "one-class" feedback form such as transactions in e-commerce and "likes" in social networks. This recommendation problem is termed as one-class collaborative filtering (OCCF). Inmost of the previous work, a pairwise preference assumption called Bayesian personalized ranking (BPR) was empirically proved to be able to exploit such one-class data well. In one of the most recent work, an upgraded model called group preference based BPR (GBPR) leverages the group preference and obtains better performance. In this paper, we go one step beyond GBPR, and propose a new and generic assumption, i.e., group Bayesian personalized ranking with rich interactions (GBPR(+)). In our GBPR(+), we adopt a set of items instead of one single item as used in GBPR, which is expected to introduce rich interactions. GBPR is a special case of our GPBR(+) when the item set contains only one single item. We study the empirical performance of our GBPR(+) with several state-of-the-art methods on four real-world datasets, and find that our GPBR(+) can generate more accurate recommendations. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:501 / 510
页数:10
相关论文
共 55 条
[1]  
Adams R., 2010, Proceedings of the 13th International Conference on Artificial Intelligence and Statistics
[2]   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
[3]  
Agarwal D, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P19
[4]  
Amer-Yahia S., 2009, VLDB Endowment, V2, P754, DOI DOI 10.14778/1687627.1687713
[5]  
[Anonymous], 2006, P 29 ANN INT ACM SIG, DOI [DOI 10.1145/1148170.1148245, 10.1145/1148170.1148245]
[6]  
[Anonymous], 2012, P 6 ACM C RECOMMENDE, DOI [10.1145/2365952.2365981, DOI 10.1145/2365952.2365981]
[7]  
[Anonymous], 2012, WSDM
[8]  
[Anonymous], 2010, P 4 ACM C REC SYST, DOI DOI 10.1145/1864708.1864770
[9]  
[Anonymous], 2004, ICML, DOI DOI 10.1145/1015330.1015366
[10]  
Berry Michael W., 1992, TECHNICAL REPORT