Towards Universal Cross-Domain RecommendationTowards Universal Cross-Domain Recommendation

被引:22
作者
Cao, Jiangxia [1 ]
Li, Shaoshuai [2 ]
Yu, Bowen [3 ]
Guo, Xiaobo [2 ]
Liu, Tingwen [1 ]
Bin Wang [4 ]
机构
[1] UCAS, Inst Informat Engn, CAS, Sch Cyber, Beijing, Peoples R China
[2] Ant Grp, MYbank, Hangzhou, Peoples R China
[3] Alibaba Grp, DAMO Acad, Beijing, Peoples R China
[4] Xiaomi Inc, Xiaomi AI Lab, Beijing, Peoples R China
来源
PROCEEDINGS OF THE SIXTEENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, WSDM 2023, VOL 1 | 2023年
基金
中国国家自然科学基金;
关键词
Cross-Domain Recommendation; Collaborative Filtering; Multitask Learning; Item Similarity Mining; Contrastive Learning;
D O I
10.1145/3539597.3570366
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In industry, web platforms such as Alibaba and Amazon often provide diverse services for users. Unsurprisingly, some developed services are data-rich, while some newly started services are data-scarce accompanied by severe data sparsity and cold-start problems. To alleviate the above problems and incubate new services easily, cross-domain recommendation (CDR) has attracted much attention from industrial and academic researchers. Generally, CDR aims to transfer rich user-item interaction information from related source domains (e.g., developed services) to boost recommendation quality of target domains (e.g., newly started services). For different scenarios, previous CDR methods can be roughly divided into two branches: (1) Data sparsity CDR fulfills user preference aided by other domain data to make intra-domain recommendations for users with few interactions, (2) Cold-start CDR projects user preference from other domain to make inter-domain recommendations for users with none interactions. In the past years, many outstanding CDR methods are emerged, however, to the best of our knowledge, none of them attempts to solve the two branches simultaneously. In this paper, we provide a unified framework, namely UniCDR, which can universally model different CDR scenarios by transferring the domain-shared information. Extensive experiments under the above 2 branches on 4 CDR scenarios and 6 public and large-scale industrial datasets demonstrate the effectiveness and universal ability of our UniCDR. Our source codes and a large-scale CDR dataset are released to facilitate academic research.
引用
收藏
页码:78 / 86
页数:9
相关论文
共 49 条
[1]  
[Anonymous], 2012, CoRR
[2]  
Barkan Oren, 2016, IEEE INT WORKSHOP MA
[3]  
Belghazi MI, 2018, PR MACH LEARN RES, V80
[4]   Cross-Market Product Recommendation [J].
Bonab, Hamed ;
Aliannejadi, Mohammad ;
Vardasbi, Ali ;
Kanoulas, Evangelos ;
Allan, James .
PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, :110-119
[5]   Item Similarity Mining for Multi-Market Recommendation [J].
Cao, Jiangxia ;
Cong, Xin ;
Liu, Tingwen ;
Wang, Bin .
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, :2249-2254
[6]   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
[7]  
Cao Jiangxia, 2022, IEEE INT C DAT ENG I
[8]   Efficient Neural Matrix Factorization without Sampling for Recommendation [J].
Chen, Chong ;
Min, Zhang ;
Zhang, Yongfeng ;
Liu, Yiqun ;
Ma, Shaoping .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2020, 38 (02)
[9]   Deep Neural Networks for YouTube Recommendations [J].
Covington, Paul ;
Adams, Jay ;
Sargin, Emre .
PROCEEDINGS OF THE 10TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'16), 2016, :191-198
[10]  
Cui Qiang, 2020, RECSYS ORSUM WORKSH