THeGCN: Temporal Heterophilic Graph Convolutional Network
Abstract
Graph Neural Networks (GNNs) have exhibited remarkable efficacy in diverse graph learning tasks, particularly on static homophilic graphs. Recent attention has pivoted towards more intricate structures, encompassing (1) static heterophilic graphs encountering the edge heterophily issue in the spatial domain and (2) event-based continuous graphs in the temporal domain. State-of-the-art (SOTA) has been concurrently addressing these two lines of work but tends to overlook the presence of heterophily in the temporal domain, constituting the temporal heterophily issue. Furthermore, we highlight that the edge heterophily issue and the temporal heterophily issue often co-exist in event-based continuous graphs, giving rise to the temporal edge heterophily challenge. To tackle this challenge, this paper first introduces the temporal edge heterophily measurement. Subsequently, we propose the emporal terophilic raph onvolutional etwork (THeGCN), an innovative model that incorporates the low/high-pass graph signal filtering technique to accurately capture both edge (spatial) heterophily and temporal heterophily. Specifically, the THeGCN\ model consists of two key components: a sampler and an aggregator. The sampler selects events relevant to a node at a given moment. Then, the aggregator executes message-passing, encoding temporal information, node attributes, and edge attributes into node embeddings. Extensive experiments conducted on 5 real-world datasets validate the efficacy of THeGCN.
Benchmark Results
Tested on 1 dataset 3 baseline values reported too low Non-standard metric on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
Sorted by Accuracy. Highlighted rows are from other papers.
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GAP-EDP | 0.9870
±0.0003 | |
| 2 | NE-ASGCN | 0.9758
±0.0027 | |
| 3 | HSGT | 0.9730
±0.0024 | |
| 21 | GraphSAGE | 0.9653
±0.0011 | |
| 22 | GAT | 0.9650
±0.0011 best reported | best at pub: Hierarchical Transformer for Scalable Graph Learning (IJCAI 2023) best today: A Scalable and Effective Alternative to Graph Transformers (AAAI 2024) |
| 26 | GCN | 0.9648 best reported | best at pub: DropEdge: Towards Deep Graph Convolutional Networks on Node Classification (ICLR 2019) |
| 71 | APPNP | 0.9500 best reported | best at pub: Dissecting the Diffusion Process in Linear Graph Convolutional Networks (NeurIPS 2021) |
| 147 | MLP | 0.8240
±0.0010 | |
| 169 | THeGCN | 0.3319
±0.0409 | This paper |
| 170 | APAN | 0.3195
±0.0218 | This paper |
| 171 | DySAT | 0.3177
±0.0196 | This paper |
| 172 | GPRGNN | 0.3124
±0.0187 | This paper |
| 173 | JODIE | 0.3080
±0.0199 | This paper |
| 174 | FAGCN | 0.3018
±0.0235 | This paper |
| 175 | TGAT | 0.2929
±0.0472 | This paper |
| 177 | TGN | 0.1578
±0.0105 | This paper |
