Contrastive Cross-Domain Sequential Recommendation

被引:62
作者
Cao, Jiangxia [1 ]
Cong, Xin [1 ]
Sheng, Jiawei [1 ]
Liu, Tingwen [1 ]
Wang, Bin [2 ]
机构
[1] Univ Chinese Acad Sci, Sch Cyber Secur, Chinese Acad Sci, Inst Informat Engn, Beijing, Peoples R China
[2] Xiaomi Inc, Xiaomi AI Lab, Beijing, Peoples R China
来源
PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022 | 2022年
关键词
Cross-Domain Sequential Recommendation; Contrastive Learning; Mutual Information Maximization;
D O I
10.1145/3511808.3557262
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cross-Domain Sequential Recommendation (CDSR) aims to predict future interactions based on user's historical sequential interactions from multiple domains. Generally, a key challenge of CDSR is how to mine precise cross-domain user preference based on the intra-sequence and inter-sequence item interactions. Existing works first learn single-domain user preference only with intra-sequence item interactions, and then build a transferring module to obtain cross-domain user preference. However, such a pipeline and implicit solution can be severely limited by the bottleneck of the designed transferring module, and ignores to consider inter-sequence item relationships. In this paper, we propose (CDSR)-D-2 to tackle the above problems to capture precise user preferences. The main idea is to simultaneously leverage the intra- and inter- sequence item relationships, and jointly learn the single- and cross- domain user preferences. Specifically, we first utilize a graph neural network to mine inter-sequence item collaborative relationship, and then exploit sequential attentive encoder to capture intra-sequence item sequential relationship. Based on them, we devise two different sequential training objectives to obtain user single-domain and cross-domain representations. Furthermore, we present a novel contrastive cross-domain infomax objective to enhance the correlation between single- and cross- domain user representations by maximizing their mutual information. Additionally, we point out a serious information leak issue in prior datasets. We correct this issue and release the corrected datasets. Extensive experiments demonstrate the effectiveness of our approach (CDSR)-D-2.
引用
收藏
页码:138 / 147
页数:10
相关论文
共 46 条
[1]  
[Anonymous], 2012, CoRR
[2]   DisenCDR: Learning Disentangled Representations for Cross-Domain Recommendation [J].
Cao, Jiangxia ;
Lin, Xixun ;
Cong, Xin ;
Ya, Jing ;
Liu, Tingwen ;
Wang, Bin .
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, :267-277
[3]   Bipartite Graph Embedding via Mutual Information Maximization [J].
Cao, Jiangxia ;
Lin, Xixun ;
Guo, Shu ;
Liu, Luchen ;
Liu, Tingwen ;
Wang, Bin .
WSDM '21: PROCEEDINGS OF THE 14TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2021, :635-643
[4]  
Cao Jiangxia, 2022, ACM INT C RES DEV IN
[5]  
Cao Jiangxia, 2022, IEEE INT C DAT ENG I
[6]  
Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171
[7]  
Diederik P., 2015, INT C LEARN REPR ICL
[8]  
Goodfellow Ian J., 2014, ANN C NEUR INF PROC
[9]  
Guo Lei, 2021, INT JOINT C ART INT
[10]   Translation-based Recommendation [J].
He, Ruining ;
Kang, Wang-Cheng ;
McAuley, Julian .
PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, :161-169