PaperScope
LIVE · 2026-09-03 05:40 UTC

Spatial Entropy based Partitioning for Spatiotemporal Graph Unlearning

Qiming Guo, Wenbo Sun, Ye Wang, Wenlu Wang

Latestcs.CLcs.LGcs.AIcs.CV
arXiv ID
2608.29360 v1
Category
Submitted
2026-08-29

Abstract

Spatiotemporal graphs underpin applications such as traffic forecasting, weather forecasting, and healthcare monitoring. Privacy regulations such as the GDPR and the CCPA require the complete removal of unauthorized data from trained models, but achieving this on a spatiotemporal graph is difficult: because information propagates globally through both spatial and temporal message passing, fully erasing a node's influence forces costly full-graph retraining. ST-graph unlearning requires both exactness and efficiency. We propose IsleNet, which uses spatial-entropy-guided partitioning to create balanced, locally coherent subgraphs and reconnects them with lightweight virtual edges. Upon an unlearning request, only the affected subgraph encoder and virtual-edge layer are retrained, ensuring exact removal with low cost. Experiments on four real-world benchmarks show that IsleNet attains up to 94% of full-graph accuracy while reducing unlearning time by up to an order of magnitude. Our code is publicly available at https://github.com/wenlu-lab/STGraphUnlearning.

Comment: Accepted at SIAM International Conference on Data Mining (SDM 2026)

arXiv abs page · PDF · same-day batch