MotifExplainer: a Motif-based Graph Neural Network Explainer
- URL: http://arxiv.org/abs/2202.00519v1
- Date: Tue, 1 Feb 2022 16:11:21 GMT
- Title: MotifExplainer: a Motif-based Graph Neural Network Explainer
- Authors: Zhaoning Yu, Hongyang Gao
- Abstract summary: We propose a novel method to explain Graph Neural Networks (GNNs) by identifying important motifs, recurrent and statistically significant patterns in graphs.
Our proposed motif-based methods can provide better human-understandable explanations than methods based on nodes, edges, and regular subgraphs.
- Score: 19.64574177805823
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We consider the explanation problem of Graph Neural Networks (GNNs). Most
existing GNN explanation methods identify the most important edges or nodes but
fail to consider substructures, which are more important for graph data. The
only method that considers subgraphs tries to search all possible subgraphs and
identify the most significant subgraphs. However, the subgraphs identified may
not be recurrent or statistically important. In this work, we propose a novel
method, known as MotifExplainer, to explain GNNs by identifying important
motifs, recurrent and statistically significant patterns in graphs. Our
proposed motif-based methods can provide better human-understandable
explanations than methods based on nodes, edges, and regular subgraphs. Given
an input graph and a pre-trained GNN model, our method first extracts motifs in
the graph using well-designed motif extraction rules. Then we generate motif
embedding by feeding motifs into the pre-trained GNN. Finally, we employ an
attention-based method to identify the most influential motifs as explanations
for the final prediction results. The empirical studies on both synthetic and
real-world datasets demonstrate the effectiveness of our method.
Related papers
- MAGE: Model-Level Graph Neural Networks Explanations via Motif-based Graph Generation [16.129359492539095]
Graph Neural Networks (GNNs) have shown remarkable success in molecular tasks, yet their interpretability remains challenging.
Traditional model-level explanation methods like XGNN and GNNInterpreter often fail to identify valid substructures like rings, leading to questionable interpretability.
We introduce an innovative textbfMotif-btextbfAsed textbfGNN textbfExplainer (MAGE) that uses motifs as fundamental units for generating explanations.
arXiv Detail & Related papers (2024-05-21T06:12:24Z) - Rethinking Explaining Graph Neural Networks via Non-parametric Subgraph
Matching [68.35685422301613]
We propose a novel non-parametric subgraph matching framework, dubbed MatchExplainer, to explore explanatory subgraphs.
It couples the target graph with other counterpart instances and identifies the most crucial joint substructure by minimizing the node corresponding-based distance.
Experiments on synthetic and real-world datasets show the effectiveness of our MatchExplainer by outperforming all state-of-the-art parametric baselines with significant margins.
arXiv Detail & Related papers (2023-01-07T05:14:45Z) - 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) - Reasoning Graph Networks for Kinship Verification: from Star-shaped to
Hierarchical [85.0376670244522]
We investigate the problem of facial kinship verification by learning hierarchical reasoning graph networks.
We develop a Star-shaped Reasoning Graph Network (S-RGN) to exploit more powerful and flexible capacity.
We also develop a Hierarchical Reasoning Graph Network (H-RGN) to exploit more powerful and flexible capacity.
arXiv Detail & Related papers (2021-09-06T03:16:56Z) - GraphSVX: Shapley Value Explanations for Graph Neural Networks [81.83769974301995]
Graph Neural Networks (GNNs) achieve significant performance for various learning tasks on geometric data.
In this paper, we propose a unified framework satisfied by most existing GNN explainers.
We introduce GraphSVX, a post hoc local model-agnostic explanation method specifically designed for GNNs.
arXiv Detail & Related papers (2021-04-18T10:40:37Z) - Finding Motifs in Knowledge Graphs using Compression [0.0]
We introduce a method to find network motifs in knowledge graphs.
We extend the common definition of a network motif to coincide with a basic graph pattern.
We show that the motifs found reflect the basic structure of the graph.
arXiv Detail & Related papers (2021-04-16T15:20:44Z) - On Explainability of Graph Neural Networks via Subgraph Explorations [48.56936527708657]
We propose a novel method, known as SubgraphX, to explain graph neural networks (GNNs)
Our work represents the first attempt to explain GNNs via identifying subgraphs explicitly.
arXiv Detail & Related papers (2021-02-09T22:12:26Z) - Motif-Driven Contrastive Learning of Graph Representations [32.03481571304036]
We propose to learn graph motifs, which are frequently-occurring subgraph patterns, for better subgraph sampling.
By pre-training on the ogbg-molhiv dataset with MICRO-Graph, the pre-trained GNN achieves 2.04% ROC-AUC average performance enhancement.
arXiv Detail & Related papers (2020-12-23T08:10:19Z) - 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) - XGNN: Towards Model-Level Explanations of Graph Neural Networks [113.51160387804484]
Graphs neural networks (GNNs) learn node features by aggregating and combining neighbor information.
GNNs are mostly treated as black-boxes and lack human intelligible explanations.
We propose a novel approach, known as XGNN, to interpret GNNs at the model-level.
arXiv Detail & Related papers (2020-06-03T23:52:43Z)
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.