Persistent Homology-induced Graph Ensembles for Time Series Regressions
By: Viet The Nguyen , Duy Anh Pham , An Thai Le and more
Potential Business Impact:
Finds hidden patterns in data for better predictions.
The effectiveness of Spatio-temporal Graph Neural Networks (STGNNs) in time-series applications is often limited by their dependence on fixed, hand-crafted input graph structures. Motivated by insights from the Topological Data Analysis (TDA) paradigm, of which real-world data exhibits multi-scale patterns, we construct several graphs using Persistent Homology Filtration -- a mathematical framework describing the multiscale structural properties of data points. Then, we use the constructed graphs as an input to create an ensemble of Graph Neural Networks. The ensemble aggregates the signals from the individual learners via an attention-based routing mechanism, thus systematically encoding the inherent multiscale structures of data. Four different real-world experiments on seismic activity prediction and traffic forecasting (PEMS-BAY, METR-LA) demonstrate that our approach consistently outperforms single-graph baselines while providing interpretable insights.
Similar Papers
Simple and Efficient Heterogeneous Temporal Graph Neural Network
Machine Learning (CS)
Makes computers understand changing online connections faster.
A Dynamic Stiefel Graph Neural Network for Efficient Spatio-Temporal Time Series Forecasting
Machine Learning (CS)
Predicts future events by understanding time and place.
A Persistent Homology Pipeline for the Analysis of Neural Spike Train Data
Methodology
Finds brain patterns that tell what you taste.