Sequential Recommendation with Dual Side Neighbor-based Collaborative Relation Modeling

被引:33
作者
Qin, Jiarui [1 ]
Ren, Kan [2 ]
Fang, Yuchen [1 ]
Zhang, Weinan [1 ]
Yu, Yong [1 ]
机构
[1] Shanghai Jiao Tong Univ, Shanghai, Peoples R China
[2] Microsoft Res Asia, Beijing, Peoples R China
来源
PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20) | 2020年
基金
中国国家自然科学基金;
关键词
Sequential Recommendation; Collaborative Filtering; Co-Attention;
D O I
10.1145/3336191.3371842
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Sequential recommendation task aims to predict user preference over items in the future given user historical behaviors. The order of user behaviors implies that there are resourceful sequential patterns embedded in the behavior history which reveal the underlying dynamics of user interests. Various sequential recommendation methods are proposed to model the dynamic user behaviors. However, most of the models only consider the user's own behaviors and dynamics, while ignoring the collaborative relations among users and items, i.e., similar tastes of users or analogous properties of items. Without modeling collaborative relations, those methods suffer from the lack of recommendation diversity and thus may have worse performance. Worse still, most existing methods only consider the user-side sequence and ignore the temporal dynamics on the item side. To tackle the problems of the current sequential recommendation models, we propose Sequential Collaborative Recommender (SCoRe) which effectively mines high-order collaborative information using cross-neighbor relation modeling and, additionally utilizes both user-side and item-side historical sequences to better capture user and item dynamics. Experiments on three real-world yet large-scale datasets demonstrate the superiority of the proposed model over strong baselines.
引用
收藏
页码:465 / 473
页数:9
相关论文
共 45 条
[1]  
[Anonymous], 2018, KDD
[2]  
[Anonymous], KDD
[3]  
[Anonymous], 2018, KDD
[4]  
[Anonymous], TKDE
[5]  
[Anonymous], 2010, ICDM
[6]  
[Anonymous], 2018, ARXIV180903672
[7]  
[Anonymous], 2018, ARXIV180803912
[8]  
[Anonymous], 2008, ACM C KNOWL DISC DAT, DOI DOI 10.1145/1401890.1401944
[9]  
[Anonymous], 2016, ICDM
[10]  
[Anonymous], ARXIV181202646