Transfer-Meta Framework for Cross-domain Recommendation to Cold-Start Users

被引:93
作者
Zhu, Yongchun [1 ,2 ,3 ]
Ge, Kaikai [3 ]
Zhuang, Fuzhen [4 ,5 ]
Xie, Ruobing [3 ]
Xi, Dongbo [1 ,2 ]
Zhang, Xu [3 ]
Lin, Leyu [3 ]
He, Qing [1 ,2 ]
机构
[1] Chinese Acad Sci, Key Lab Intelligent Informat Proc, Inst Comp Technol, CAS, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[3] WeChat Search Applicat Dept, Tencent, Peoples R China
[4] Beihang Univ, Inst Artificial Intelligence, Beijing 100191, Peoples R China
[5] Chinese Acad Sci, Xiamen Data Intelligence Acad ICT, Beijing, Peoples R China
来源
SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL | 2021年
基金
中国国家自然科学基金;
关键词
Cross-domain Recommendation; Meta Learning; Cold-start;
D O I
10.1145/3404835.3463010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cold-start problems are enormous challenges in practical recommender systems. One promising solution for this problem is cross-domain recommendation (CDR) which leverages rich information from an auxiliary (source) domain to improve the performance of recommender system in the target domain. In these CDR approaches, the family of Embedding and Mapping methods for CDR (EMCDR) is very effective, which explicitly learn a mapping function from source embeddings to target embeddings with overlapping users. However, these approaches suffer from one serious problem: the mapping function is only learned on limited overlapping users, and the function would be biased to the limited overlapping users, which leads to unsatisfying generalization ability and degrades the performance on cold-start users in the target domain. With the advantage of meta learning which has good generalization ability to novel tasks, we propose a transfer-meta framework for CDR (TMCDR) which has a transfer stage and a meta stage. In the transfer (pre-training) stage, a source model and a target model are trained on source and target domains, respectively. In the meta stage, a task-oriented meta network is learned to implicitly transform the user embedding in the source domain to the target feature space. In addition, the TMCDR is a general framework that can be applied upon various base models, e.g., MF, BPR, CML. By utilizing data from Amazon and Douban, we conduct extensive experiments on 6 cross-domain tasks to demonstrate the superior performance and compatibility of TMCDR.
引用
收藏
页码:1813 / 1817
页数:5
相关论文
共 19 条
[1]  
Andrychowicz M, 2016, ADV NEUR IN, V29
[2]  
Finn C, 2017, PR MACH LEARN RES, V70
[3]  
Fu WJ, 2019, AAAI CONF ARTIF INTE, P94
[4]   Cross-domain Recommendation Without Sharing User-relevant Data [J].
Gao, Chen ;
Chen, Xiangning ;
Feng, Fuli ;
Zhao, Kai ;
He, Xiangnan ;
Li, Yong ;
Jin, Depeng .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :491-502
[5]   A General Cross-domain Recommendation Framework via Bayesian Neural Network [J].
He, Jia ;
Liu, Rui ;
Zhuang, Fuzhen ;
Lin, Fen ;
Niu, Cheng ;
He, Qing .
2018 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2018, :1001-1006
[6]   Neural Factorization Machines for Sparse Predictive Analytics [J].
He, Xiangnan ;
Chua, Tat-Seng .
SIGIR'17: PROCEEDINGS OF THE 40TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2017, :355-364
[7]   Collaborative Metric Learning [J].
Hsieh, Cheng-Kang ;
Yang, Longqi ;
Cui, Yin ;
Lin, Tsung-Yi ;
Belongie, Serge ;
Estrin, Deborah .
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, :193-201
[8]   Semi-Supervised Learning for Cross-Domain Recommendation to Cold-Start Users [J].
Kang, SeongKu ;
Hwang, Junyoung ;
Lee, Dongha ;
Yu, Hwanjo .
PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, :1563-1572
[9]  
King DB, 2015, ACS SYM SER, V1214, P1, DOI 10.1021/bk-2015-1214.ch001
[10]   MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS [J].
Koren, Yehuda ;
Bell, Robert ;
Volinsky, Chris .
COMPUTER, 2009, 42 (08) :30-37