JOURNAL ARTICLE

Path-aware Multi-hop Question Answering Over Knowledge Graph Embedding

Abstract

Question answering over knowledge graph (KGQA) aims at answering questions posed over the knowledge graph (KG). Multi-hop KGQA requires multi-hop reasoning on KG to achieve the correct answer. Unfortunately, KGs are usually incomplete with many missing links, which poses additional challenges to KGQA. KG embedding-based KGQA methods have recently been proposed as a way to overcome this limitation. However, existing KG embedding-based KGQA methods fail to take full advantage of semantic correlations between questions and paths. Furthermore, their inference process is not easily explainable. To address these challenges, we propose a novel path-aware multi-hop KGQA model (PA-KGQA), which can fully capture semantic correlations between the paths and the questions in a feature-interactive manner. Specifically, we introduce a case-enhanced path retriever to evaluate the importance of paths between topic entities and candidate answer entities, and then propose an interactive convolutional neural network (ICNN) to model the interactions between paths and questions for mining richer correlation features. Experiments show that PA-KGQA achieves state-of-the-art results on multiple benchmark datasets and is explainable.

Keywords:
Computer science Embedding Knowledge graph Inference Question answering Graph Theoretical computer science Path (computing) Artificial intelligence Information retrieval Machine learning Data mining

Metrics

2
Cited By
0.39
FWCI (Field Weighted Citation Impact)
38
Refs
0.64
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Topic Modeling
Physical Sciences →  Computer Science →  Artificial Intelligence
Advanced Graph Neural Networks
Physical Sciences →  Computer Science →  Artificial Intelligence
Multimodal Machine Learning Applications
Physical Sciences →  Computer Science →  Computer Vision and Pattern Recognition
© 2026 ScienceGate Book Chapters — All rights reserved.