TL;DR
This paper introduces a multi-level interactive contrastive learning approach for knowledge-aware recommendation systems, effectively leveraging local and non-local knowledge graph information to address data sparsity and improve recommendation accuracy.
Contribution
It proposes a novel layer-wise contrastive learning mechanism that interacts within and between local and non-local graphs, enhancing knowledge extraction in GNN-based recommender systems.
Findings
Outperforms state-of-the-art methods on three benchmark datasets.
Effectively utilizes local and non-local KG facts for better recommendations.
Addresses data sparsity issues in knowledge-aware recommendation.
Abstract
Incorporating Knowledge Graphs (KG) into recommeder system has attracted considerable attention. Recently, the technical trend of Knowledge-aware Recommendation (KGR) is to develop end-to-end models based on graph neural networks (GNNs). However, the extremely sparse user-item interactions significantly degrade the performance of the GNN-based models, as: 1) the sparse interaction, means inadequate supervision signals and limits the supervised GNN-based models; 2) the combination of sparse interactions (CF part) and redundant KG facts (KG part) results in an unbalanced information utilization. Besides, the GNN paradigm aggregates local neighbors for node representation learning, while ignoring the non-local KG facts and making the knowledge extraction insufficient. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsContrastive Learning
