Contextualized Graph Attention Network for Recommendation with Item Knowledge Graph
Not on the map. Why?
Abstract (arXiv)
Graph neural networks (GNN) have recently been applied to exploit knowledge graph (KG) for recommendation. Existing GNN-based methods explicitly model the dependency between an entity and its local graph context in KG (i.e., the set of its first-order neighbors), but may not be effective in capturing its non-local graph context (i.e., the set of most related high-order neighbors). In this paper, we propose a novel recommendation framework, named Contextualized Graph Attention Network (CGAT), which can explicitly exploit both local and non-local graph context information of an entity in KG. Specifically, CGAT captures the local context information by a user-specific graph attention mechanism, considering a user's personalized preferences on entities. Moreover, CGAT employs a biased random walk sampling process to extract the non-local context of an entity, and utilizes a Recurrent Neural Network (RNN) to model the dependency between the entity and its non-local contextual entities. To capture the user's personalized preferences on items, an item-specific attention mechanism is also developed to model the dependency between a target item and the contextual items extracted from the user's historical behaviors. Experimental results on real datasets demonstrate the effectiveness of CGAT, compared with state-of-the-art KG-based recommendation methods.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 3; 2024: 1; 2025: 2; 2026: 2.
10 papers.
- 2022Contrastive Meta Learning with Behavior Multiplicity for Recommendationcited by 37
- 2023Cross-domain recommendation via user interest alignmentcited by 19
- 2021KGPool: Dynamic Knowledge Graph Context Selection for Relation Extractioncited by 12
- 2025Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Modelcited by 7
- 2025TrustGLM: Evaluating the Robustness of GraphLLMs Against Prompt, Text, and Structure Attackscited by 5
- 2023Semantics-enhanced Temporal Graph Networks for Content Popularity Predictioncited by 1
- 2023TriMLP: Revenge of a MLP-like Architecture in Sequential Recommendationcited by 1
- 2024TIGER: Temporally Improved Graph Entity Linkercited by 0
- 2026Multi-Level Graph Attention Network Contrastive Learning for Knowledge-Aware Recommendationcited by 0
- 2026Knowledge Graphs Meet Graph Neural Networks: A Comprehensive Surveycited by 0
- 2026Knowledge Graphs Meet Graph Neural Networks: A Comprehensive Survey12 May 2026
- 2026Multi-Level Graph Attention Network Contrastive Learning for Knowledge-Aware Recommendation8 May 2026
- 2025TrustGLM: Evaluating the Robustness of GraphLLMs Against Prompt, Text, and Structure Attacks13 Jun 2025
- 2025Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Model26 Jan 2025
- 2024TIGER: Temporally Improved Graph Entity Linker11 Oct 2024
- 2023TriMLP: Revenge of a MLP-like Architecture in Sequential Recommendation24 May 2023
- 2023Semantics-enhanced Temporal Graph Networks for Content Popularity Prediction29 Jan 2023
- 2023Cross-domain recommendation via user interest alignment26 Jan 2023
- 2022Contrastive Meta Learning with Behavior Multiplicity for Recommendation17 Feb 2022
- 2021KGPool: Dynamic Knowledge Graph Context Selection for Relation Extraction1 Jun 2021