paper-with-me

Papers

Path-based Explanation for Knowledge Graph Completion

2024-01-04 · Heng Chang, Jiangnan Ye, Alejo Lopez Avila, Jinhua Du, Jia Li

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.

📄 PDF Abstract BibTeX arXiv:2401.02290

Code (1)

OUTHIM/power-link 공식 구현

Tasks

Knowledge Graph Completion

Similar Papers 제목 키워드 기반

Relational Message Passing for Knowledge Graph Completion

2020-02-17 · Hongwei Wang, Hongyu Ren, Jure Leskovec

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 Prediction

eXpath: Explaining Knowledge Graph Link Prediction with Ontological Closed Path Rules

2024-12-06 · Ye Sun, Lei Shi, Yongxin Tong

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 Prediction

KGExplainer: Towards Exploring Connected Subgraph Explanations for Knowledge Graph Completion

2024-04-05 · Tengfei Ma, Xiang Song, Wen Tao, Mufei Li 외

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 Graphs

OxKBC: Outcome Explanation for Factorization Based Knowledge Base Completion

2020-02-14 · AKBC 2020 6 · Yatin Nandwani, Ankesh Gupta, Aman Agrawal, Mayank Singh Chauhan 외

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 Completion

Dynamically Pruned Message Passing Networks for Large-Scale Knowledge Graph Reasoning

2019-09-25 · ICLR 2020 1 · Xiaoran Xu, Wei Feng, Yunsheng Jiang, Xiaohui Xie 외

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