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

• URL: http://arxiv.org/abs/2412.04846v1
• Date: Fri, 06 Dec 2024 08:33:49 GMT
• Title: eXpath: Explaining Knowledge Graph Link Prediction with Ontological Closed Path Rules
• Authors: Ye Sun, Lei Shi, Yongxin Tong,
• Abstract summary: Link prediction (LP) is crucial for Knowledge Graphs (KG) completion but commonly suffers from interpretability issues.<n>We propose to explain LP models in KG with path-based explanations.
• Score: 12.802269132505364
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 limited to local explanations on KG and are deficient in providing human interpretable semantics. Based on real-world observations of the characteristics of KGs from multiple domains, we propose to explain LP models in KG with path-based explanations. An integrated framework, namely eXpath, is introduced which incorporates the concept of relation path with ontological closed path rules to enhance both the efficiency and effectiveness of LP interpretation. Notably, the eXpath explanations can be fused with other single-link explanation approaches to achieve a better overall solution. Extensive experiments across benchmark datasets and LP models demonstrate that introducing eXpath can boost the quality of resulting explanations by about 20% on two key metrics and reduce the required explanation time by 61.4%, in comparison to the best existing method. Case studies further highlight eXpath's ability to provide more semantically meaningful explanations through path-based evidence.

Related papers

• Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering [75.12322966980003]
  Large Language Models (LLMs) have shown strong inductive reasoning ability across various domains.<n>Most existing RAG pipelines rely on unstructured text, limiting interpretability and structured reasoning.<n>Recent studies have explored integrating knowledge graphs with LLMs for knowledge graph question answering.<n>We propose RAPL, a novel framework for efficient and effective graph retrieval in KGQA.
  arXiv  Detail & Related papers  (2025-06-11T12:03:52Z)
• Soft Reasoning Paths for Knowledge Graph Completion [63.23109723605835]
  Reasoning paths are reliable information in knowledge graph completion (KGC)<n>In real-world applications, it is difficult to guarantee that computationally affordable paths exist toward all candidate entities.<n>We introduce soft reasoning paths to make the proposed algorithm more stable against missing path circumstances.
  arXiv  Detail & Related papers  (2025-05-06T08:12:48Z)
• K-Paths: Reasoning over Graph Paths for Drug Repurposing and Drug Interaction Prediction [21.72997408572975]
  K-Paths is a model-agnostic retrieval framework that extracts structured, diverse, and biologically meaningful multi-hop paths from dense biomedical knowledge graphs.<n>These paths enable the prediction of unobserved drug-drug and drug-disease interactions.<n>Experiments show that K-Paths improves zero-shot reasoning across state-of-the-art language models.
  arXiv  Detail & Related papers  (2025-02-18T23:55:24Z)
• Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models [83.28737898989694]
  Large language models (LLMs) struggle with faithful reasoning due to knowledge gaps and hallucinations. We introduce graph-constrained reasoning (GCR), a novel framework that bridges structured knowledge in KGs with unstructured reasoning in LLMs. GCR achieves state-of-the-art performance and exhibits strong zero-shot generalizability to unseen KGs without additional training.
  arXiv  Detail & Related papers  (2024-10-16T22:55:17Z)
• Look Globally and Reason: Two-stage Path Reasoning over Sparse Knowledge Graphs [70.8150181683017]
  Sparse Knowledge Graphs (KGs) contain fewer facts in the form of (head entity, relation, tail entity) compared to more populated KGs. This paper proposes a two-stage path reasoning model called LoGRe (Look Globally and Reason) over sparse KGs.
  arXiv  Detail & Related papers  (2024-07-26T07:10:27Z)
• Path-based Explanation for Knowledge Graph Completion [17.541247786437484]
  Proper explanations for the results of GNN-based Knowledge Graph Completion models increase model transparency. Existing practices for explaining KGC tasks rely on instance/subgraph-based approaches. We propose Power-Link, the first path-based KGC explainer that explores GNN-based models.
  arXiv  Detail & Related papers  (2024-01-04T14:19:37Z)
• Anchoring Path for Inductive Relation Prediction in Knowledge Graphs [69.81600732388182]
  APST takes both APs and CPs as the inputs of a unified Sentence Transformer architecture. We evaluate APST on three public datasets and achieve state-of-the-art (SOTA) performance in 30 of 36 transductive, inductive, and few-shot experimental settings.
  arXiv  Detail & Related papers  (2023-12-21T06:02:25Z)
• Faithful Path Language Modeling for Explainable Recommendation over Knowledge Graph [15.40937702266105]
  We introduce PEARLM (Path-based Explainable-Accurate Recommender based on Language Modelling), which innovates with a Knowledge Graph Constraint Decoding (KGCD) mechanism. This mechanism ensures zero incidence of corrupted paths by enforcing adherence to valid KG connections at the decoding level. We validate the effectiveness of our approach through a rigorous empirical assessment, employing a newly proposed metric that quantifies the integrity of explanation paths.
  arXiv  Detail & Related papers  (2023-10-25T08:14:49Z)
• PaGE-Link: Path-based Graph Neural Network Explanation for Heterogeneous Link Prediction [37.57586847539004]
  Transparency and accountability have become major concerns for black-box machine learning (ML) models. We propose Path-based GNN Explanation for heterogeneous Link prediction (PaGE-Link) that generates explanations with connection interpretability. We show that explanations generated by PaGE-Link improve AUC for recommendation on citation and user-item graphs by 9 - 35% and are chosen by 78.79% of responses in human evaluation.
  arXiv  Detail & Related papers  (2023-02-24T05:43:47Z)
• Multi-Aspect Explainable Inductive Relation Prediction by Sentence Transformer [60.75757851637566]
  We introduce the concepts of relation path coverage and relation path confidence to filter out unreliable paths prior to model training to elevate the model performance. We propose Knowledge Reasoning Sentence Transformer (KRST) to predict inductive relations in knowledge graphs.
  arXiv  Detail & Related papers  (2023-01-04T15:33:49Z)
• Supporting Vision-Language Model Inference with Confounder-pruning Knowledge Prompt [71.77504700496004]
  Vision-language models are pre-trained by aligning image-text pairs in a common space to deal with open-set visual concepts. To boost the transferability of the pre-trained models, recent works adopt fixed or learnable prompts. However, how and what prompts can improve inference performance remains unclear.
  arXiv  Detail & Related papers  (2022-05-23T07:51:15Z)
• Path-based knowledge reasoning with textual semantic information for medical knowledge graph completion [20.929596842568994]
  Medical knowledge graphs (KGs) are often significantly incomplete, so it necessitating a demand for medical knowledge graph completion (MedKGC) MedKGC can find new facts based on the exited knowledge in the KGs. This paper proposes two novel path-based reasoning methods to solve the sparsity issues of entity and path respectively.
  arXiv  Detail & Related papers  (2021-05-27T11:45:59Z)
• Joint Semantics and Data-Driven Path Representation for Knowledge Graph Inference [60.048447849653876]
  We propose a novel joint semantics and data-driven path representation that balances explainability and generalization in the framework of KG embedding. Our proposed model is evaluated on two classes of tasks: link prediction and path query answering task.
  arXiv  Detail & Related papers  (2020-10-06T10:24:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.