.png){kind=icon}
.png){kind=icon}
Return
Knowledge-aware graph augmentation for learning to recommend
.png){kind=icon}
PRE
AI
DOI：10.1007/s10844-026-01029-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years, recommender systems have increasingly focused on providing personalized suggestions based on individual user preferences and interaction history. However, many existing approaches rely on fixed or mechanical sampling strategies, which fail to capture the rich diversity in sample distributions. As a result, these methods lack flexibility and adaptability, limiting their overall performance. In addition, traditional denoising techniques often involve the random removal of nodes or edges, which can lead to the loss of important structural information and user-item interaction patterns. This hinders the model's ability to generalize and weakens its robustness. To address these issues, we propose Knowledge-Aware Graph Augmentation for Learning to Recommend (KAGLR). The KAGLR framework consists of two main components. First, it uses variational graph reconstruction to estimate a Gaussian distribution for each node in the interaction graph. By sampling from these distributions, the model generates multiple contrastive views that preserve the original graph structure and enable the discovery of hidden user-item relationships. Second, we introduce an automated graph augmentation module for denoising. This module adaptively removes noisy elements from the interaction graph while preserving essential properties, allowing the model to capture deeper interaction patterns. We evaluate KAGLR through extensive experiments on benchmark datasets. The results show that KAGLR consistently outperforms existing methods, achieving state-of-the-art performance in recommendation tasks.
Keywords:
Recommender system
Contrastive learning
Knowledge-aware
Denoising model
Journal
J
IF:
3.4
Papers:
75
Citations:
0