mlsanityData to 7 Oct 2026

DisCo: Graph-Based Disentangled Contrastive Learning for Cold-Start Cross-Domain Recommendation

arXiv 2412.15005 ↗First posted 19 Dec 2024cs.IR cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Recommender systems are widely used in various real-world applications, but they often encounter the persistent challenge of the user cold-start problem. Cross-domain recommendation (CDR), which leverages user interactions from one domain to improve prediction performance in another, has emerged as a promising solution. However, users with similar preferences in the source domain may exhibit different interests in the target domain. Therefore, directly transferring embeddings may introduce irrelevant source-domain collaborative information. In this paper, we propose a novel graph-based disentangled contrastive learning framework to capture fine-grained user intent and filter out irrelevant collaborative information, thereby avoiding negative transfer. Specifically, for each domain, we use a multi-channel graph encoder to capture diverse user intents. We then construct the affinity graph in the embedding space and perform multi-step random walks to capture high-order user similarity relationships. Treating one domain as the target, we propose a disentangled intent-wise contrastive learning approach, guided by user similarity, to refine the bridging of user intents across domains. Extensive experiments on four benchmark CDR datasets demonstrate that DisCo consistently outperforms existing state-of-the-art baselines, thereby validating the effectiveness of both DisCo and its components.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 16 of its 38 references that are in the map. First posted on arXiv 19 Dec 2024.

Builds on

16 of 38 references.

References · 16

  1. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
  2. 2019Neural Graph Collaborative Filteringcited by 660
  3. 2020Disentangled Graph Collaborative Filteringcited by 118
  4. 2019Learning Disentangled Representations for Recommendationcited by 110
  5. 2018CoNet: Collaborative Cross Networks for Cross-Domain Recommendationcited by 81
  6. 2019DDTCDR: Deep Dual Transfer Cross Domain Recommendationcited by 71
  7. 2024A Survey of Graph Neural Networks in Real world: Imbalance, Noise, Privacy and OOD Challengescited by 54
  8. 2020Improving Disentangled Text Representation Learning with Information-Theoretic Guidancecited by 52
  9. 2021DisenHAN: Disentangled Heterogeneous Graph Attention Network for Recommendationcited by 28
  10. 2024Towards Graph Contrastive Learning: A Survey and Beyondcited by 26
  11. 2021Transfer-Meta Framework for Cross-domain Recommendation to Cold-Start Userscited by 24
  12. 2023Decoupled Contrastive Multi-View Clustering with High-Order Random Walkscited by 23
4 more
  1. 2022Cross-Domain Recommendation to Cold-Start Users via Variational Information Bottleneckcited by 21
  2. 2024A Survey of Data-Efficient Graph Learningcited by 18
  3. 2024CDRNP: Cross-Domain Recommendation to Cold-Start Users via Neural Processcited by 5
  4. 2024DisenSemi: Semi-supervised Graph Classification via Disentangled Representation Learningcited by 3

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.