EPERM: An Evidence Path Enhanced Reasoning Model for Knowledge Graph Question and Answering
Xiao Long, Liansheng Zhuang, Aodi Li, Minghong Yao, Shafei Wang

TL;DR
EPERM is a three-stage framework that enhances reasoning in knowledge graph question answering by retrieving, filtering, and weighting evidence paths to improve LLM performance.
Contribution
This paper introduces EPERM, a novel method that reformulates KGQA as a graphical model and emphasizes the importance of evidence paths for reasoning.
Findings
EPERM outperforms existing KGQA methods on benchmark datasets.
Filtering and weighting evidence paths improves reasoning accuracy.
EPERM effectively reduces hallucinations in LLM-based KGQA.
Abstract
Due to the remarkable reasoning ability, Large language models (LLMs) have demonstrated impressive performance in knowledge graph question answering (KGQA) tasks, which find answers to natural language questions over knowledge graphs (KGs). To alleviate the hallucinations and lack of knowledge issues of LLMs, existing methods often retrieve the question-related information from KGs to enrich the input context. However, most methods focus on retrieving the relevant information while ignoring the importance of different types of knowledge in reasoning, which degrades their performance. To this end, this paper reformulates the KGQA problem as a graphical model and proposes a three-stage framework named the Evidence Path Enhanced Reasoning Model (EPERM) for KGQA. In the first stage, EPERM uses the fine-tuned LLM to retrieve a subgraph related to the question from the original knowledge…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Semantic Web and Ontologies · Advanced Graph Neural Networks
MethodsFocus
