跳到主要导航 跳到搜索 跳到主要内容

Measure Domain's Gap: A Similar Domain Selection Principle for Multi-Domain Recommendation

  • Yi Wen
  • , Yue Liu
  • , Derong Xu
  • , Huishi Luo
  • , Pengyue Jia
  • , Yiqing Wu
  • , Siwei Wang
  • , Ke Liang
  • , Maolin Wang*
  • , Yiqi Wang
  • , Fuzhen Zhuang*
  • , Xiangyu Zhao*
  • *此作品的通讯作者
  • City University of Hong Kong
  • National University of Singapore
  • Institute of Artificial Intelligence
  • Chinese Academy of Sciences
  • Intelligent Game and Decision Lab
  • National University of Defense Technology

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Multi-Domain Recommendation (MDR) achieves the desirable recommendation performance by effectively utilizing the transfer information across different domains. Despite the great success, most existing MDR methods adopt a single structure to transfer complex domain-shared knowledge. However, the beneficial transferring information should vary across different domains. When there is knowledge conflict between domains or a domain is of poor quality, unselectively leveraging information from all domains will lead to a serious Negative Transfer Problem (NTP). Therefore, how to effectively model the complex transfer relationships between domains to avoid NTP is still a direction worth exploring. To address these issues, we propose a simple and dynamic Similar Domain Selection Principle (SDSP) for multi-domain recommendation in this paper. SDSP presents the initial exploration of selecting suitable domain knowledge for each domain to alleviate NTP. Specifically, we propose a novel prototype-based domain distance measure to effectively model the complexity relationship between domains. Thereafter, the proposed SDSP can dynamically find similar domains for each domain based on the supervised signals of the domain metrics and the unsupervised distance measure from the learned domain prototype. We emphasize that SDSP is a lightweight method that can be incorporated with existing MDR methods for better performance while not introducing excessive time overheads. To the best of our knowledge, it is the first solution that can explicitly measure domain-level gaps and dynamically select appropriate domains in the MDR field. Extensive experiments on three datasets demonstrate the effectiveness of our proposed method.

源语言英语
主期刊名KDD 2025 - Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining
出版商Association for Computing Machinery
3156-3167
页数12
ISBN(电子版)9798400714542
DOI
出版状态已出版 - 3 8月 2025
活动31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2025 - Toronto, 加拿大
期限: 3 8月 20257 8月 2025

出版系列

姓名Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
2
ISSN(印刷版)2154-817X

会议

会议31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2025
国家/地区加拿大
Toronto
时期3/08/257/08/25

指纹

探究 'Measure Domain's Gap: A Similar Domain Selection Principle for Multi-Domain Recommendation' 的科研主题。它们共同构成独一无二的指纹。

引用此