Path-based Explanation for Knowledge Graph Completion
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.
Code (1)
Tasks
Knowledge Graph CompletionSimilar Papers 제목 키워드 기반
Relational Message Passing for Knowledge Graph Completion
Knowledge graph completion aims to predict missing relations between entities in a knowledge graph. In this work, we propose a relational message passing method for knowledge graph completion. Different from existing emb…
Knowledge Graph CompletionRelationRelation PredictioneXpath: Explaining Knowledge Graph Link Prediction with Ontological Closed Path Rules
Link prediction (LP) is crucial for Knowledge Graphs (KG) completion but commonly suffers from interpretability issues. While several methods have been proposed to explain embedding-based LP models, they are generally li…
Knowledge GraphsLink PredictionKGExplainer: Towards Exploring Connected Subgraph Explanations for Knowledge Graph Completion
Knowledge graph completion (KGC) aims to alleviate the inherent incompleteness of knowledge graphs (KGs), which is a critical task for various applications, such as recommendations on the web. Although knowledge graph em…
Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge GraphsOxKBC: Outcome Explanation for Factorization Based Knowledge Base Completion
State-of-the-art models for Knowledge Base Completion (KBC) are based on tensor factorization (TF), e.g, DistMult, ComplEx. While they produce good results, they cannot expose any rationale behind their predictions, pote…
Automated Theorem ProvingKnowledge Base CompletionDynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning
We propose Dynamically Pruned Message Passing Networks (DPMPN) for large-scale knowledge graph reasoning. In contrast to existing models, embedding-based or path-based, we learn an input-dependent subgraph to explicitly …
Knowledge Base Completion