Unveiling Global Interactive Patterns across Graphs: Towards Interpretable Graph Neural Networks
Open Access
- 24 August 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 3277-3288
Abstract
Graph Neural Networks (GNNs) have emerged as a prominent framework for graph mining, leading to significant advances across various domains. Stemmed from the node-wise representations of GNNs, existing explanation studies have embraced the subgraph-specific viewpoint that attributes the decision results to the salient features and local structures of nodes. However, graph-level tasks necessitate long-range dependencies and global interactions for advanced GNNs, deviating significantly from subgraph-specific explanations. To bridge this gap, this paper proposes a novel intrinsically interpretable scheme for graph classification, termed as Global Interactive Pattern (GIP) learning, which introduces learnable global interactive patterns to explicitly interpret decisions. GIP first tackles the complexity of interpretation by clustering numerous nodes using a constrained graph clustering module. Then, it matches the coarsened global interactive instance with a batch of self-interpretable graph prototypes, thereby facilitating a transparent graph-level reasoning process. Extensive experiments conducted on both synthetic and real-world benchmarks demonstrate that the proposed GIP yields significantly superior interpretability and competitive performance to the state-of-the-art counterparts. Our code will be made publicly available¹.Keywords
All Related Versions
Funding Information
- Joint Funds of the Zhejiang Provincial Natural Science Foundation of China (LHZSD24F020001)
This publication has 29 references indexed in Scilit:
- Deep MinCut: Learning Node Embeddings by Detecting CommunitiesPattern Recognition, 2022
- Molecular generative Graph Neural Networks for Drug DiscoveryNeurocomputing, 2021
- Explainability Methods for Graph Convolutional Neural Networks2019
- Multi-Similarity Loss With General Pair Weighting for Deep Metric Learning2019
- Mastering the game of Go without human knowledgeNature, 2017
- Distinguishing Enzyme Structures from Non-enzymes Without AlignmentsJournal of Molecular Biology, 2003
- On Graph Kernels: Hardness Results and Efficient Alternatives2003
- Predicting protein function from structure: Unique structural features of proteasesProceedings of the National Academy of Sciences, 2000
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- Silhouettes: A graphical aid to the interpretation and validation of cluster analysisJournal of Computational and Applied Mathematics, 1987