Utilizing Description Logics for Global Explanations of Heterogeneous Graph Neural Networks

• URL: http://arxiv.org/abs/2405.12654v1
• Date: Tue, 21 May 2024 10:07:29 GMT
• Title: Utilizing Description Logics for Global Explanations of Heterogeneous Graph Neural Networks
• Authors: Dominik Köhler, Stefan Heindorf,
• Abstract summary: We propose utilizing class expressions (CEs) from the field of description logic (DL) to explain classes with multiple sufficient explanations. Our approach explains heterogeneous graphs with different types of nodes using CEs in the EL description logic.
• Score: 0.25782420501870296
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph Neural Networks (GNNs) are effective for node classification in graph-structured data, but they lack explainability, especially at the global level. Current research mainly utilizes subgraphs of the input as local explanations or generates new graphs as global explanations. However, these graph-based methods are limited in their ability to explain classes with multiple sufficient explanations. To provide more expressive explanations, we propose utilizing class expressions (CEs) from the field of description logic (DL). Our approach explains heterogeneous graphs with different types of nodes using CEs in the EL description logic. To identify the best explanation among multiple candidate explanations, we employ and compare two different scoring functions: (1) For a given CE, we construct multiple graphs, have the GNN make a prediction for each graph, and aggregate the predicted scores. (2) We score the CE in terms of fidelity, i.e., we compare the predictions of the GNN to the predictions by the CE on a separate validation set. Instead of subgraph-based explanations, we offer CE-based explanations.

Related papers

• Global Graph Counterfactual Explanation: A Subgraph Mapping Approach [54.42907350881448]
  Graph Neural Networks (GNNs) have been widely deployed in various real-world applications. Counterfactual explanation aims to find minimum perturbations on input graphs that change the GNN predictions. We propose GlobalGCE, a novel global-level graph counterfactual explanation method.
  arXiv  Detail & Related papers  (2024-10-25T21:39:05Z)
• Explaining Graph Neural Networks for Node Similarity on Graphs [9.14795454299225]
  We investigate how GNN-based methods for computing node similarities can be augmented with explanations. Specifically, we evaluate the performance of two approaches towards explanations in GNNs. We find that unlike MI explanations, gradient-based explanations have three desirable properties.
  arXiv  Detail & Related papers  (2024-07-10T13:20:47Z)
• View-based Explanations for Graph Neural Networks [27.19300566616961]
  We propose GVEX, a novel paradigm that generates Graph Views for EXplanation. We show that this strategy provides an approximation ratio of 1/2. Our second algorithm performs a single-pass to an input node stream in batches to incrementally maintain explanation views.
  arXiv  Detail & Related papers  (2024-01-04T06:20:24Z)
• GANExplainer: GAN-based Graph Neural Networks Explainer [5.641321839562139]
  It is critical to explain why graph neural network (GNN) makes particular predictions for them to be believed in many applications. We propose GANExplainer, based on Generative Adversarial Network (GAN) architecture. GANExplainer improves explanation accuracy by up to 35% compared to its alternatives.
  arXiv  Detail & Related papers  (2022-12-30T23:11:24Z)
• PAGE: Prototype-Based Model-Level Explanations for Graph Neural Networks [12.16789930553124]
  Prototype-bAsed GNN-Explainer (Page) is a novel model-level explanation method for graph classification. Page discovers a common subgraph pattern by iteratively searching for high matching nodes. Using six graph classification datasets, we demonstrate that PAGE qualitatively and quantitatively outperforms the state-of-the-art model-level explanation method.
  arXiv  Detail & Related papers  (2022-10-31T09:10:06Z)
• Towards Explanation for Unsupervised Graph-Level Representation Learning [108.31036962735911]
  Existing explanation methods focus on the supervised settings, eg, node classification and graph classification, while the explanation for unsupervised graph-level representation learning is still unexplored. In this paper, we advance the Information Bottleneck principle (IB) to tackle the proposed explanation problem for unsupervised graph representations, which leads to a novel principle, textitUnsupervised Subgraph Information Bottleneck (USIB) We also theoretically analyze the connection between graph representations and explanatory subgraphs on the label space, which reveals that the robustness of representations benefit the fidelity of explanatory subgraphs.
  arXiv  Detail & Related papers  (2022-05-20T02:50:15Z)
• Reinforced Causal Explainer for Graph Neural Networks [112.57265240212001]
  Explainability is crucial for probing graph neural networks (GNNs) We propose a reinforcement learning agent, Reinforced Causal Explainer (RC-Explainer) RC-Explainer generates faithful and concise explanations, and has a better power to unseen graphs.
  arXiv  Detail & Related papers  (2022-04-23T09:13:25Z)
• ExplaGraphs: An Explanation Graph Generation Task for Structured Commonsense Reasoning [65.15423587105472]
  We present a new generative and structured commonsense-reasoning task (and an associated dataset) of explanation graph generation for stance prediction. Specifically, given a belief and an argument, a model has to predict whether the argument supports or counters the belief and also generate a commonsense-augmented graph that serves as non-trivial, complete, and unambiguous explanation for the predicted stance. A significant 83% of our graphs contain external commonsense nodes with diverse structures and reasoning depths.
  arXiv  Detail & Related papers  (2021-04-15T17:51:36Z)
• Parameterized Explainer for Graph Neural Network [49.79917262156429]
  We propose PGExplainer, a parameterized explainer for Graph Neural Networks (GNNs) Compared to the existing work, PGExplainer has better generalization ability and can be utilized in an inductive setting easily. Experiments on both synthetic and real-life datasets show highly competitive performance with up to 24.7% relative improvement in AUC on explaining graph classification.
  arXiv  Detail & Related papers  (2020-11-09T17:15:03Z)
• Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning [63.97983530843762]
  Graph Neural Networks (GNNs) have achieved great success in graph representation learning. GNNs generate identical representations for graph substructures that may in fact be very different. More powerful GNNs, proposed recently by mimicking higher-order tests, are inefficient as they cannot sparsity of underlying graph structure. We propose Distance Depiction (DE) as a new class of graph representation learning.
  arXiv  Detail & Related papers  (2020-08-31T23:15:40Z)

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.