Table of Contents
Fetching ...

KGBridge: Knowledge-Guided Prompt Learning for Non-overlapping Cross-Domain Recommendation

Yuhan Wang, Qing Xie, Zhifeng Bao, Mengzi Tang, Lin Li, Yongjian Liu

TL;DR

KGBridge tackles non-overlapping cross-domain sequential recommendation by shifting from entity-centric to relation-centric knowledge transfer. It introduces a KG-enhanced Prompt Encoder that encodes relation-level semantics as soft prompts, split into domain-shared and domain-specific banks, and a two-stage training paradigm that performs cross-domain pretraining followed by privacy-preserving fine-tuning with a correspondence-driven disentanglement mechanism. The approach yields superior performance over both KG-based and non-KG baselines, and demonstrates robustness to KG sparsity and stability of transfer through controlled disentanglement. The work advances practical cross-domain transfer under platform isolation, enhancing transferability, interpretability, and stability in KG-enhanced recommender systems.

Abstract

Knowledge Graphs (KGs), as structured knowledge bases that organize relational information across diverse domains, provide a unified semantic foundation for cross-domain recommendation (CDR). By integrating symbolic knowledge with user-item interactions, KGs enrich semantic representations, support reasoning, and enhance model interpretability. Despite this potential, existing KG-based methods still face major challenges in CDR, particularly under non-overlapping user scenarios. These challenges arise from: (C1) sensitivity to KG sparsity and popularity bias, (C2) dependence on overlapping users for domain alignment and (C3) lack of explicit disentanglement between transferable and domain-specific knowledge, which limit effective and stable knowledge transfer. To this end, we propose KGBridge, a knowledge-guided prompt learning framework for cross-domain sequential recommendation under non-overlapping user scenarios. KGBridge comprises two core components: a KG-enhanced Prompt Encoder, which models relation-level semantics as soft prompts to provide structured and dynamic priors for user sequence modeling (addressing C1), and a Two-stage Training Paradigm, which combines cross-domain pretraining and privacy-preserving fine-tuning to enable knowledge transfer without user overlap (addressing C2). By combining relation-aware semantic control with correspondence-driven disentanglement, KGBridge explicitly separates and balances domain-shared and domain-specific semantics, thereby maintaining complementarity and stabilizing adaptation during fine-tuning (addressing C3). Extensive experiments on benchmark datasets demonstrate that KGBridge consistently outperforms state-of-the-art baselines and remains robust under varying KG sparsity, highlighting its effectiveness in mitigating structural imbalance and semantic entanglement in KG-enhanced cross-domain recommendation.

KGBridge: Knowledge-Guided Prompt Learning for Non-overlapping Cross-Domain Recommendation

TL;DR

KGBridge tackles non-overlapping cross-domain sequential recommendation by shifting from entity-centric to relation-centric knowledge transfer. It introduces a KG-enhanced Prompt Encoder that encodes relation-level semantics as soft prompts, split into domain-shared and domain-specific banks, and a two-stage training paradigm that performs cross-domain pretraining followed by privacy-preserving fine-tuning with a correspondence-driven disentanglement mechanism. The approach yields superior performance over both KG-based and non-KG baselines, and demonstrates robustness to KG sparsity and stability of transfer through controlled disentanglement. The work advances practical cross-domain transfer under platform isolation, enhancing transferability, interpretability, and stability in KG-enhanced recommender systems.

Abstract

Knowledge Graphs (KGs), as structured knowledge bases that organize relational information across diverse domains, provide a unified semantic foundation for cross-domain recommendation (CDR). By integrating symbolic knowledge with user-item interactions, KGs enrich semantic representations, support reasoning, and enhance model interpretability. Despite this potential, existing KG-based methods still face major challenges in CDR, particularly under non-overlapping user scenarios. These challenges arise from: (C1) sensitivity to KG sparsity and popularity bias, (C2) dependence on overlapping users for domain alignment and (C3) lack of explicit disentanglement between transferable and domain-specific knowledge, which limit effective and stable knowledge transfer. To this end, we propose KGBridge, a knowledge-guided prompt learning framework for cross-domain sequential recommendation under non-overlapping user scenarios. KGBridge comprises two core components: a KG-enhanced Prompt Encoder, which models relation-level semantics as soft prompts to provide structured and dynamic priors for user sequence modeling (addressing C1), and a Two-stage Training Paradigm, which combines cross-domain pretraining and privacy-preserving fine-tuning to enable knowledge transfer without user overlap (addressing C2). By combining relation-aware semantic control with correspondence-driven disentanglement, KGBridge explicitly separates and balances domain-shared and domain-specific semantics, thereby maintaining complementarity and stabilizing adaptation during fine-tuning (addressing C3). Extensive experiments on benchmark datasets demonstrate that KGBridge consistently outperforms state-of-the-art baselines and remains robust under varying KG sparsity, highlighting its effectiveness in mitigating structural imbalance and semantic entanglement in KG-enhanced cross-domain recommendation.

Paper Structure

This paper contains 33 sections, 13 equations, 4 figures, 5 tables.

Figures (4)

  • Figure 1: Entity frequency distribution in KGs, where most entities participate in only a few triples, exhibiting a pronounced long-tail pattern.
  • Figure 2: Overview of the proposed KGBridge
  • Figure 3: Effect of KG sparsity on KG-based methods
  • Figure 4: Comparison w.r.t. different values of $\lambda$