arrow
Return

An explainable path reasoning framework for knowledge graph completion

delete2025-12-17
delete0
delete
OA
AI
H
Haiyang Yu
H
Hong Yu
王卫 cover
王卫 (Wei Wang) *
K
Kai Fang *
X
Xiaotong Zhang
H
Han Liu *
DOI:10.1016/j.aej.2025.12.024delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
• Propose an Explainable Path Reasoning (EPR) framework for knowledge graph completion. • Synergize statistical path mining with a unified BERT-based semantic reasoner. • A single architecture jointly generates predictions and faithful multi-hop explanations. • Achieve competitive results among explainable models, narrowing the performance gap. • Demonstrate that concise paths (2-3 hops) are sufficient for robust reasoning.
Keywords:
Deep learning
Knowledge graph completion
Representation learning
Explainable AI
Semantic communication
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Alexandria Engineering Journal cover
Alexandria Engineering Journal
IF:
6.8
Papers:
6.3K
Citations:
2.6W

Organization

Z
Zhejiang A&F University
Scholars:
1.0W
Papers: 6.1K
Citations: 178
M
Macao Polytechnic University
Scholars:
1.6K
Papers: 1.4K
Citations: 805
D
Dalian University of Technology
Scholars:
5.8W
Papers: 4.3W
Citations: 5.5W
researcher View more organizations