Adaptive Spatiotemporal Augmentation for Improving Dynamic Graph Learning

Xu Chu, Hanlin Xue, Bingce Wang, Xiaoyang Liu, Weiping Li +3 more
1/17/2025
cs.LGcs.AI

No official code found. Best implementation: ColinNeverLand/STAA (1 star, last commit 2024-11-06).

Abstract

Dynamic graph augmentation is used to improve the performance of dynamic GNNs. Most methods assume temporal locality, meaning that recent edges are more influential than earlier edges. However, for temporal changes in edges caused by random noise, overemphasizing recent edges while neglecting earlier ones may lead to the model capturing noise. To address this issue, we propose STAA (SpatioTemporal Activity-Aware Random Walk Diffusion). STAA identifies nodes likely to have noisy edges in spatiotemporal dimensions. Spatially, it analyzes critical topological positions through graph wavelet coefficients. Temporally, it analyzes edge evolution through graph wavelet coefficient change rates. Then, random walks are used to reduce the weights of noisy edges, deriving a diffusion matrix containing spatiotemporal information as an augmented adjacency matrix for dynamic GNN learning. Experiments on multiple datasets show that STAA outperforms other dynamic graph augmentation methods in node classification and link prediction tasks.

View on arXivView PDF

Code Implementations(1)

ColinNeverLand/STAACommunity100%
10Shell, PythonSep 3, 20241 years ago

Similar Papers

Cite this paper

@article{chu2025adaptive,
  title  = {Adaptive Spatiotemporal Augmentation for Improving Dynamic Graph Learning},
  author = {Xu Chu and Hanlin Xue and Bingce Wang and Xiaoyang Liu and Weiping Li and Tong Mo and Tuoyu Feng and Zhijie Tan},
  year   = {2025},
  eprint = {2501.10010},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.10010v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.10010.svg)](https://codeofpaper.com/paper/2501.10010)

Discussion