- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes KGE-Path, an interpretable knowledge graph embedding framework for link prediction. It derives predictions from the geometric relationships between entity embeddings and generates path-based explanations by measuring geometric consistency. The method further introduces edge and node penalties and a regularization term to improve prediction and explanation. Experiments on six datasets demonstrate competitive prediction performance, improved explanation quality, and faster per-query explanation on four datasets.
Critical strengths
- Unified prediction and explanation framework. KGE-Path derives predictions and path-based explanations from the same embedding geometry, avoiding additional explainer training. This provides a coherent and potentially efficient approach to interpretable link prediction.
- Strong empirical performance. Experiments across six datasets demonstrate competitive prediction accuracy and consistently strong explanation results compared with existing baselines. The method also achieves faster per-query explanation on four datasets, supporting its practical value.
Critical weaknesses
- Insufficient justification of explanation faithfulness. Although Equation (9) establishes a geometric connection between prediction and explanation, Assumption 1 further links smaller path composition errors to stronger evidential support. This connection is not sufficiently justified or directly validated, leaving some uncertainty about the paper's claim that the explanations faithfully reflect how predictions are made.
- Insufficient ablation of key training components. The ablation study evaluates the overall training adaptation without separately examining the edge and node penalties. As these components serve different purposes, their individual contributions remain unclear, limiting the empirical support for the proposed training design.
Questions for authors
- Beyond the geometric relationship established in Equation (9), what theoretical or empirical evidence supports Assumption 1 that lower path composition errors indicate stronger evidence for the predicted relation?
- Could the authors provide separate ablation results for the edge penalty and node penalty to clarify their individual contributions to prediction and explanation performance?
- How are multiple ground-truth relations between the same ordered entity pair handled during training and evaluation, given the single-valued relation mapping in Section 2 and the prediction rule in Equation (7)?
- What motivates the selection of only the highest-scoring path as the explanation path in Equation (11)? Could multiple high-scoring paths provide more complete explanations, particularly when the ground truth contains multiple explanatory paths?
- How does KGE-Path differ from recent related methods such as PGNN-Link (IEEE Transactions on Knowledge and Data Engineering, 2026) and KGC-Explainer (IEEE Transactions on Reliability, 2026) in terms of its explanation mechanism and contributions? Discussing these recent methods in the paper would help clarify the positioning and distinctive contributions of KGE-Path.