Inter- and Intra-Domain Potential User Preferences for Cross-Domain Recommendation

被引:1
作者
Liu, Jing [1 ]
Sun, Lele [1 ]
Nie, Weizhi [1 ]
Su, Yuting [1 ]
Zhang, Yongdong [2 ]
Liu, Anan [1 ]
机构
[1] Tianjin Univ, Sch Elect & Informat Engn, Tianjin 300072, Peoples R China
[2] Univ Sci & Technol China, Hefei 230052, Peoples R China
关键词
Attention mechanism; cross-domain recommendation; transfer learning; MEDIATION;
D O I
10.1109/TMM.2024.3374577
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data sparsity poses a persistent challenge in Recommender Systems (RS), driving the emergence of Cross-Domain Recommendation (CDR) as a potential remedy. However, most existing CDR methods often struggle to circumvent the transfer of domain-specific information, which are perceived as noise in the target domain. Additionally, they primarily concentrate on inter-domain information transfer, disregarding the comprehensive exploration of data within intra-domains. To address these limitations, we propose SUCCDR (Separating User features with Compound samples), a novel approach that tackles data sparsity by leveraging both cross-domain knowledge transfer and comprehensive intra-domain analysis. Specifically, to ensure the exclusion of noisy domain-specific features during the transfer process, user preferences are separated into domain-invariant and domain-specific features through three efficient constraints. Furthermore, the unobserved items are leveraged to generate compound samples that intelligently merge observed and unobserved potential user-item interaction, utilizing a simple yet efficient attention mechanism to enable a comprehensive and unbiased representation of user preferences. We evaluate the performance of SUCCDR on two real-world datasets, Douban and Amazon, and compare it with state-of-the-art single-domain and cross-domain recommendation methods. The experimental results demonstrate that SUCCDR outperforms existing approaches, highlighting its ability to effectively alleviate data sparsity problem.
引用
收藏
页码:8014 / 8025
页数:12
相关论文
共 50 条
[21]   A Graph Neural Network for Cross-domain Recommendation Based on Transfer and Inter-domain Contrastive Learning [J].
Mu, Caihong ;
Ying, Jiahui ;
Fang, Yunfei ;
Liu, Yi .
KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, PT III, KSEM 2023, 2023, 14119 :226-234
[22]   Domain-Oriented Knowledge Transfer for Cross-Domain Recommendation [J].
Zhao, Guoshuai ;
Zhang, Xiaolong ;
Tang, Hao ;
Shen, Jialie ;
Qian, Xueming .
IEEE TRANSACTIONS ON MULTIMEDIA, 2024, 26 :9539-9550
[23]   Domain-Invariant Task Optimization for Cross-domain Recommendation [J].
Liu, Dou ;
Hao, Qingbo ;
Xiao, Yingyuan ;
Zheng, Wenguang ;
Wang, Jinsong .
NEURAL INFORMATION PROCESSING, ICONIP 2023, PT III, 2024, 14449 :488-499
[24]   A deep selective learning network for cross-domain recommendation [J].
Liu, Huiting ;
Liu, Qian ;
Li, Peipei ;
Zhao, Peng ;
Wu, Xindong .
APPLIED SOFT COMPUTING, 2022, 125
[25]   Cross-domain recommendation based on latent factor alignment [J].
Yu, Xu ;
Hu, Qiang ;
Li, Hui ;
Du, Junwei ;
Gao, Jia ;
Sun, Lijun .
NEURAL COMPUTING & APPLICATIONS, 2022, 34 (05) :3421-3432
[26]   Cross-domain Recommendation with Bridge-Item Embeddings [J].
Gao, Chen ;
Li, Yong ;
Feng, Fuli ;
Chen, Xiangning ;
Zhao, Kai ;
He, Xiangnan ;
Jin, Depeng .
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2022, 16 (01)
[27]   Latent mutual feature extraction for cross-domain recommendation [J].
Park, Hoon ;
Jung, Jason J. .
KNOWLEDGE AND INFORMATION SYSTEMS, 2024, 66 (06) :3337-3354
[28]   Selective Knowledge Transfer for Cross-Domain Collaborative Recommendation [J].
Zhang, Hongwei ;
Kong, Xiangwei ;
Zhang, Yujia .
IEEE ACCESS, 2021, 9 :48039-48051
[29]   Cross-domain recommendation based on latent factor alignment [J].
Xu Yu ;
Qiang Hu ;
Hui Li ;
Junwei Du ;
Jia Gao ;
Lijun Sun .
Neural Computing and Applications, 2022, 34 :3421-3432
[30]   ATLRec: An Attentional Adversarial Transfer Learning Network for Cross-Domain Recommendation [J].
Li, Ying ;
Xu, Jia-Jie ;
Zhao, Peng-Peng ;
Fang, Jun-Hua ;
Chen, Wei ;
Zhao, Lei .
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2020, 35 (04) :794-808