Spatial Aggregation and Temporal Convolution Networks for Real-time
Kriging
- URL: http://arxiv.org/abs/2109.12144v1
- Date: Fri, 24 Sep 2021 18:43:07 GMT
- Title: Spatial Aggregation and Temporal Convolution Networks for Real-time
Kriging
- Authors: Yuankai Wu, Dingyi Zhuang, Mengying Lei, Aurelie Labbe, Lijun Sun
- Abstract summary: SATCN is a universal and flexible framework to performtemporal kriging for various datasets without need for model specification.
We capture nodes by temporal convolutional networks, which allows our model to cope with data of diverse sizes.
We conduct extensive experiments on three real-world datasets, including traffic and climate recordings.
- Score: 3.4386226615580107
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Spatiotemporal kriging is an important application in spatiotemporal data
analysis, aiming to recover/interpolate signals for unsampled/unobserved
locations based on observed signals. The principle challenge for spatiotemporal
kriging is how to effectively model and leverage the spatiotemporal
dependencies within the data. Recently, graph neural networks (GNNs) have shown
great promise for spatiotemporal kriging tasks. However, standard GNNs often
require a carefully designed adjacency matrix and specific aggregation
functions, which are inflexible for general applications/problems. To address
this issue, we present SATCN -- Spatial Aggregation and Temporal Convolution
Networks -- a universal and flexible framework to perform spatiotemporal
kriging for various spatiotemporal datasets without the need for model
specification. Specifically, we propose a novel spatial aggregation network
(SAN) inspired by Principal Neighborhood Aggregation, which uses multiple
aggregation functions to help one node gather diverse information from its
neighbors. To exclude information from unsampled nodes, a masking strategy that
prevents the unsampled sensors from sending messages to their neighborhood is
introduced to SAN. We capture temporal dependencies by the temporal
convolutional networks, which allows our model to cope with data of diverse
sizes. To make SATCN generalizable to unseen nodes and even unseen graph
structures, we employ an inductive strategy to train SATCN. We conduct
extensive experiments on three real-world spatiotemporal datasets, including
traffic speed and climate recordings. Our results demonstrate the superiority
of SATCN over traditional and GNN-based kriging models.
Related papers
- Fully-Connected Spatial-Temporal Graph for Multivariate Time-Series Data [50.84488941336865]
We propose a novel method called Fully- Spatial-Temporal Graph Neural Network (FC-STGNN)
For graph construction, we design a decay graph to connect sensors across all timestamps based on their temporal distances.
For graph convolution, we devise FC graph convolution with a moving-pooling GNN layer to effectively capture the ST dependencies for learning effective representations.
arXiv Detail & Related papers (2023-09-11T08:44:07Z) - Adaptive Hierarchical SpatioTemporal Network for Traffic Forecasting [70.66710698485745]
We propose an Adaptive Hierarchical SpatioTemporal Network (AHSTN) to promote traffic forecasting.
AHSTN exploits the spatial hierarchy and modeling multi-scale spatial correlations.
Experiments on two real-world datasets show that AHSTN achieves better performance over several strong baselines.
arXiv Detail & Related papers (2023-06-15T14:50:27Z) - Temporal Aggregation and Propagation Graph Neural Networks for Dynamic
Representation [67.26422477327179]
Temporal graphs exhibit dynamic interactions between nodes over continuous time.
We propose a novel method of temporal graph convolution with the whole neighborhood.
Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
arXiv Detail & Related papers (2023-04-15T08:17:18Z) - It is all Connected: A New Graph Formulation for Spatio-Temporal
Forecasting [1.278093617645299]
We propose a framework for learning temporal and spatial dependencies using Graph Neural Network (GNN) networks.
GNNs represent every sample as its own node in a graph, rather than all measurements for a particular location as a single node.
The framework does not require measurements along the temporal dimension, meaning that it also facilitates irregular time series, different frequencies or missing data, without the need for data sampling imputation.
arXiv Detail & Related papers (2023-03-23T11:16:33Z) - Space-Time Graph Neural Networks with Stochastic Graph Perturbations [100.31591011966603]
Space-time graph neural networks (ST-GNNs) learn efficient graph representations of time-varying data.
In this paper we revisit the properties of ST-GNNs and prove that they are stable to graph stabilitys.
Our analysis suggests that ST-GNNs are suitable for transfer learning on time-varying graphs.
arXiv Detail & Related papers (2022-10-28T16:59:51Z) - Scalable Spatiotemporal Graph Neural Networks [14.415967477487692]
Graph neural networks (GNNs) are often the core component of the forecasting architecture.
In most pretemporal GNNs, the computational complexity scales up to a quadratic factor with the length of the sequence times the number of links in the graph.
We propose a scalable architecture that exploits an efficient encoding of both temporal and spatial dynamics.
arXiv Detail & Related papers (2022-09-14T09:47:38Z) - Graph-Time Convolutional Neural Networks: Architecture and Theoretical
Analysis [12.995632804090198]
We introduce Graph-Time Convolutional Neural Networks (GTCNNs) as principled architecture to aid learning.
The approach can work with any type of product graph and we also introduce a parametric graph to learn also the producttemporal coupling.
Extensive numerical results on benchmark corroborate our findings and show the GTCNN compares favorably with state-of-the-art solutions.
arXiv Detail & Related papers (2022-06-30T10:20:52Z) - STONet: A Neural-Operator-Driven Spatio-temporal Network [38.5696882090282]
Graph-based graph-temporal neural networks are effective to model spatial dependency among discrete points sampled irregularly.
We propose atemporal framework based on neural operators for PDEs, which learn the mechanisms governing the dynamics of spatially-continuous physical quantities.
Experiments show our model's performance on forecasting spatially-continuous physic quantities, and its superior to unseen spatial points and ability to handle temporally-irregular data.
arXiv Detail & Related papers (2022-04-18T17:20:12Z) - Space-Time Graph Neural Networks [104.55175325870195]
We introduce space-time graph neural network (ST-GNN) to jointly process the underlying space-time topology of time-varying network data.
Our analysis shows that small variations in the network topology and time evolution of a system does not significantly affect the performance of ST-GNNs.
arXiv Detail & Related papers (2021-10-06T16:08:44Z) - SST-GNN: Simplified Spatio-temporal Traffic forecasting model using
Graph Neural Network [2.524966118517392]
We have designed a simplified S-temporal GNN(SST-GNN) that effectively encodes the dependency by separately aggregating different neighborhood.
We have shown that our model has significantly outperformed the state-of-the-art models on three real-world traffic datasets.
arXiv Detail & Related papers (2021-03-31T18:28:44Z) - Policy-GNN: Aggregation Optimization for Graph Neural Networks [60.50932472042379]
Graph neural networks (GNNs) aim to model the local graph structures and capture the hierarchical patterns by aggregating the information from neighbors.
It is a challenging task to develop an effective aggregation strategy for each node, given complex graphs and sparse features.
We propose Policy-GNN, a meta-policy framework that models the sampling procedure and message passing of GNNs into a combined learning process.
arXiv Detail & Related papers (2020-06-26T17:03:06Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.