TL;DR
This paper introduces Global Interactive Pattern (GIP) learning, a novel interpretable framework for graph classification that captures global interactions and long-range dependencies, improving interpretability and maintaining competitive accuracy.
Contribution
It proposes a new intrinsically interpretable scheme using global interactive patterns and clustering to explain graph-level decisions, addressing limitations of subgraph explanations.
Findings
GIP achieves superior interpretability over existing methods.
GIP maintains competitive performance on benchmark datasets.
Extensive experiments validate the effectiveness of GIP in real-world scenarios.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
