GCN-SE: Attention as Explainability for Node Classification in Dynamic Graphs
Yucai Fan, Yuhang Yao, Carlee Joe-Wong

TL;DR
GCN-SE introduces a learnable attention mechanism for dynamic graphs, improving node classification by effectively weighting temporal snapshots and providing explainability of snapshot importance.
Contribution
The paper proposes GCN-SE, a novel method that applies attention weights to graph snapshots in dynamic graphs, enhancing classification accuracy and interpretability.
Findings
GCN-SE outperforms existing methods on various datasets.
Attention weights correlate with snapshot importance.
The approach offers explainability for dynamic graph models.
Abstract
Graph Convolutional Networks (GCNs) are a popular method from graph representation learning that have proved effective for tasks like node classification tasks. Although typical GCN models focus on classifying nodes within a static graph, several recent variants propose node classification in dynamic graphs whose topologies and node attributes change over time, e.g., social networks with dynamic relationships, or literature citation networks with changing co-authorships. These works, however, do not fully address the challenge of flexibly assigning different importance to snapshots of the graph at different times, which depending on the graph dynamics may have more or less predictive power on the labels. We address this challenge by proposing a new method, GCN-SE, that attaches a set of learnable attention weights to graph snapshots at different times, inspired by Squeeze and Excitation…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Functional Brain Connectivity Studies
MethodsGraph Convolutional Network
