Skip to main navigation Skip to search Skip to main content

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*
  • *Corresponding author for this work
  • 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
  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationKDD 2025 - Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining
PublisherAssociation for Computing Machinery
Pages3156-3167
Number of pages12
ISBN (Electronic)9798400714542
DOIs
StatePublished - 3 Aug 2025
Externally publishedYes
Event31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2025 - Toronto, Canada
Duration: 3 Aug 20257 Aug 2025

Publication series

NameProceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
Volume2
ISSN (Print)2154-817X

Conference

Conference31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2025
Country/TerritoryCanada
CityToronto
Period3/08/257/08/25

Keywords

  • multi-domain recommendation
  • negative transfer

Fingerprint

Dive into the research topics of 'Measure Domain's Gap: A Similar Domain Selection Principle for Multi-Domain Recommendation'. Together they form a unique fingerprint.

Cite this