mlsanityData to 14 Oct 2026

Boosting Knowledge Graph-based Recommendations through Confidence-Aware Augmentation with Large Language Models

arXiv 2502.03715 ↗First posted 6 Feb 2025cs.IR cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Knowledge Graph-based recommendations have gained significant attention due to their ability to leverage rich semantic relationships. However, constructing and maintaining Knowledge Graphs (KGs) is resource-intensive, and the accuracy of KGs can suffer from noisy, outdated, or irrelevant triplets. Recent advancements in Large Language Models (LLMs) offer a promising way to improve the quality and relevance of KGs for recommendation tasks. Despite this, integrating LLMs into KG-based systems presents challenges, such as efficiently augmenting KGs, addressing hallucinations, and developing effective joint learning methods. In this paper, we propose the Confidence-aware KG-based Recommendation Framework with LLM Augmentation (CKG-LLMA), a novel framework that combines KGs and LLMs for recommendation task. The framework includes: (1) an LLM-based subgraph augmenter for enriching KGs with high-quality information, (2) a confidence-aware message propagation mechanism to filter noisy triplets, and (3) a dual-view contrastive learning method to integrate user-item interactions and KG data. Additionally, we employ a confidence-aware explanation generation process to guide LLMs in producing realistic explanations for recommendations. Finally, extensive experiments demonstrate the effectiveness of CKG-LLMA across multiple public datasets.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 26 of its 34 references that are in the map. First posted on arXiv 6 Feb 2025.

Builds on

26 of 34 references.

References · 26

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  2. 2017Graph Attention Networkscited by 8,923
  3. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  4. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
  5. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  6. 2018Self-Attentive Sequential Recommendationcited by 1,184
  7. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  8. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 520
  9. 2023A Survey on Large Language Models for Recommendationcited by 379
  10. 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 343
  11. 2020Self-supervised Graph Learning for Recommendationcited by 305
  12. 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
14 more
  1. 2023LLMRec: Large Language Models with Graph Augmentation for Recommendationcited by 172
  2. 2020A Survey on Knowledge Graph-Based Recommender Systemscited by 170
  3. 2023Representation Learning with Large Language Models for Recommendationcited by 155
  4. 2019Knowledge Graph Convolutional Networks for Recommender Systemscited by 121
  5. 2021Learning Intents behind Interactions with Knowledge Graph for Recommendationcited by 94
  6. 2023Can Knowledge Graphs Reduce Hallucinations in LLMs? : A Surveycited by 92
  7. 2022Knowledge Graph Contrastive Learning for Recommendationcited by 70
  8. 2018Improving Question Answering by Commonsense-Based Pre-Trainingcited by 66
  9. 2022XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendationcited by 57
  10. 2023Knowledge Graph Self-Supervised Rationalization for Recommendationcited by 22
  11. 2024Multi-perspective Improvement of Knowledge Graph Completion with Large Language Modelscited by 20
  12. 2022Tele-Knowledge Pre-training for Fault Analysiscited by 18
  13. 2023LKPNR: LLM and KG for Personalized News Recommendation Frameworkcited by 13
  14. 2024AFDGCF: Adaptive Feature De-correlation Graph Collaborative Filtering for Recommendationscited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.