Path-based Explanation for Knowledge Graph Completion

Heng Chang, Jiangnan Ye, Alejo Lopez Avila, Jinhua Du, Jia Li
1/4/2024
cs.LGcs.AIcs.SI

No official code found. Best implementation: OUTHIM/power-link (8 stars, last commit 2026-04-28).

Abstract

Graph Neural Networks (GNNs) have achieved great success in Knowledge Graph Completion (KGC) by modelling how entities and relations interact in recent years. However, the explanation of the predicted facts has not caught the necessary attention. Proper explanations for the results of GNN-based KGC models increase model transparency and help researchers develop more reliable models. Existing practices for explaining KGC tasks rely on instance/subgraph-based approaches, while in some scenarios, paths can provide more user-friendly and interpretable explanations. Nonetheless, the methods for generating path-based explanations for KGs have not been well-explored. To address this gap, we propose Power-Link, the first path-based KGC explainer that explores GNN-based models. We design a novel simplified graph-powering technique, which enables the generation of path-based explanations with a fully parallelisable and memory-efficient training scheme. We further introduce three new metrics for quantitative evaluation of the explanations, together with a qualitative human evaluation. Extensive experiments demonstrate that Power-Link outperforms the SOTA baselines in interpretability, efficiency, and scalability.

View on arXivView PDF

Code Implementations(1)

OUTHIM/power-linkCommunity100%

This is the repository for the KDD 2024 paper **Path-based Explanation for Knowledge Graph Completion**

80Jun 16, 20245 months ago

Similar Papers

Cite this paper

@article{chang2024pathbased,
  title  = {Path-based Explanation for Knowledge Graph Completion},
  author = {Heng Chang and Jiangnan Ye and Alejo Lopez Avila and Jinhua Du and Jia Li},
  year   = {2024},
  eprint = {2401.02290},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.02290v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.02290.svg)](https://codeofpaper.com/paper/2401.02290)

Discussion