KGIF: Optimizing Relation-Aware Recommendations with Knowledge Graph Information Fusion
Not on the map. Why?
Abstract (arXiv)
While deep-learning-enabled recommender systems demonstrate strong performance benchmarks, many struggle to adapt effectively in real-world environments due to limited use of user-item relationship data and insufficient transparency in recommendation generation. Traditional collaborative filtering approaches fail to integrate multifaceted item attributes, and although Factorization Machines account for item-specific details, they overlook broader relational patterns. Collaborative knowledge graph-based models have progressed by embedding user-item interactions with item-attribute relationships, offering a holistic perspective on interconnected entities. However, these models frequently aggregate attribute and interaction data in an implicit manner, leaving valuable relational nuances underutilized. This study introduces the Knowledge Graph Attention Network with Information Fusion (KGIF), a specialized framework designed to merge entity and relation embeddings explicitly through a tailored self-attention mechanism. The KGIF framework integrates reparameterization via dynamic projection vectors, enabling embeddings to adaptively represent intricate relationships within knowledge graphs. This explicit fusion enhances the interplay between user-item interactions and item-attribute relationships, providing a nuanced balance between user-centric and item-centric representations. An attentive propagation mechanism further optimizes knowledge graph embeddings, capturing multi-layered interaction patterns. The contributions of this work include an innovative method for explicit information fusion, improved robustness for sparse knowledge graphs, and the ability to generate explainable recommendations through interpretable path visualization.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 42 references that are in the map. First posted on arXiv 7 Jan 2025.
Builds on
23 of 42 references.
References · 23
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 686
- 2019Neural Graph Collaborative Filteringcited by 660
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
- 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 342
- 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
- 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
11 more
- 2018RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systemscited by 136
- 2019Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systemscited by 107
- 2019Reinforcement Knowledge Graph Reasoning for Explainable Recommendationcited by 102
- 2021Learning Intents behind Interactions with Knowledge Graph for Recommendationcited by 94
- 2022Knowledge Graph Contrastive Learning for Recommendationcited by 69
- 2022Towards Robust Graph Neural Networks for Noisy Graphs with Sparse Labelscited by 63
- 2019Jointly Learning Explainable Rules for Recommendation with Knowledge Graphcited by 40
- 2022Decoupled Side Information Fusion for Sequential Recommendationcited by 30
- 2021Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networkscited by 22
- 2023Knowledge Graph Self-Supervised Rationalization for Recommendationcited by 22
- 2023Data Scarcity in Recommendation Systems: A Surveycited by 17
Built on by
Citing papers per year: 2025: 2.
2 papers.