Interest-Aware Graph Contrastive Learning for Recommendation With Diffusion-Based Augmentation
Graph Contrastive Learning (GCL) has recently garnered significant attention for enhancing recommender systems. Most existing GCL-based methods perturb the raw data graph to generate views, performing contrastive learning across these views to learn generalizable representations. However, most of these methods rely on data- or model-based augmentation techniques that may disrupt interest consistency. In this paper, we propose a novel interest-aware augmentation approach based on diffusion models to address this issue. Specifically, we leverage a conditional diffusion model to generate interest-consistent views by conditioning on node interaction information, ensuring that the generated views align with the interests of the nodes. Based on this augmentation method, we introduce DiffCL, a graph contrastive learning framework for recommendation. Furthermore, we propose an easy-to-hard generation strategy. By progressively adjusting the starting point of the reverse denoising process, this strategy further enhances effective contrastive learning. We evaluate DiffCL on three public real-world datasets, and results indicate that our method outperforms state-of-the-art techniques, demonstrating its effectiveness.
Authors
- Jiadi Yu (ORCID: https://orcid.org/0000-0002-0207-9643)
- Mengyuan Jing (ORCID: https://orcid.org/0000-0002-0159-4256)
- Feilong Tang
- Yanmin Zhu (ORCID: https://orcid.org/0000-0001-6406-4992)
Institutions
- Shanghai Jiao Tong University (CN)
Publication Details
- Journal
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2025-10-13
- DOI
- https://doi.org/10.1109/tkde.2025.3620600
- Primary Topic
- Recommender Systems and Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00