Dynamic Localisation of Spatial-Temporal Graph Neural Network

• URL: http://arxiv.org/abs/2501.04239v3
• Date: Wed, 15 Jan 2025 07:59:39 GMT
• Title: Dynamic Localisation of Spatial-Temporal Graph Neural Network
• Authors: Wenying Duan, Shujun Guo, Wei huang, Hong Rao, Xiaoxi He,
• Abstract summary: spatial-temporal graph neural networks (ASTGNNs) have emerged as valuable tools for modelling dependencies. This paper introduces an innovative perspective that spatial dependencies should be dynamically evolving over time. We introduce textitDynAGS, a localised ASTGNN framework aimed at maximising efficiency and accuracy in distributed deployment.
• Score: 8.257228815160849
• License:
• Abstract: Spatial-temporal data, fundamental to many intelligent applications, reveals dependencies indicating causal links between present measurements at specific locations and historical data at the same or other locations. Within this context, adaptive spatial-temporal graph neural networks (ASTGNNs) have emerged as valuable tools for modelling these dependencies, especially through a data-driven approach rather than pre-defined spatial graphs. While this approach offers higher accuracy, it presents increased computational demands. Addressing this challenge, this paper delves into the concept of localisation within ASTGNNs, introducing an innovative perspective that spatial dependencies should be dynamically evolving over time. We introduce \textit{DynAGS}, a localised ASTGNN framework aimed at maximising efficiency and accuracy in distributed deployment. This framework integrates dynamic localisation, time-evolving spatial graphs, and personalised localisation, all orchestrated around the Dynamic Graph Generator, a light-weighted central module leveraging cross attention. The central module can integrate historical information in a node-independent manner to enhance the feature representation of nodes at the current moment. This improved feature representation is then used to generate a dynamic sparse graph without the need for costly data exchanges, and it supports personalised localisation. Performance assessments across two core ASTGNN architectures and nine real-world datasets from various applications reveal that \textit{DynAGS} outshines current benchmarks, underscoring that the dynamic modelling of spatial dependencies can drastically improve model expressibility, flexibility, and system efficiency, especially in distributed settings.

Related papers

• DyG-Mamba: Continuous State Space Modeling on Dynamic Graphs [59.434893231950205]
  Dynamic graph learning aims to uncover evolutionary laws in real-world systems. We propose DyG-Mamba, a new continuous state space model for dynamic graph learning. We show that DyG-Mamba achieves state-of-the-art performance on most datasets.
  arXiv  Detail & Related papers  (2024-08-13T15:21:46Z)
• FedASTA: Federated adaptive spatial-temporal attention for traffic flow prediction [30.346763969306398]
  Mobile devices and the Internet of Things (IoT) devices nowadays generate a large amount of heterogeneous spatial-temporal data. It remains a challenging problem to model the spatial-temporal dynamics under privacy concern. We propose a novel Federated Adaptive spatial-temporal Attention (FedASTA) framework to model the dynamic spatial-temporal relations.
  arXiv  Detail & Related papers  (2024-05-21T11:44:07Z)
• Mending of Spatio-Temporal Dependencies in Block Adjacency Matrix [3.529869282529924]
  We propose a novel end-to-end learning architecture designed to mend the temporal dependencies, resulting in a well-connected graph. Our methodology demonstrates superior performance on benchmark datasets, such as SurgVisDom and C2D2.
  arXiv  Detail & Related papers  (2023-10-04T06:42:33Z)
• 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)
• Localised Adaptive Spatial-Temporal Graph Neural Network [17.707594255626216]
  Adaptive Graph Sparsification (AGS) is a graph sparsification algorithm which successfully enables the localisation of ASTGNNs to an extreme extent. We observe that spatial graphs in ASTGNNs can be sparsified by over 99.5% without any decline in test accuracy. Localisation of ASTGNNs holds the potential to reduce the heavy overhead required on large-scale spatial-temporal data.
  arXiv  Detail & Related papers  (2023-06-12T08:08:53Z)
• An Adaptive Federated Relevance Framework for Spatial Temporal Graph Learning [14.353798949041698]
  We propose an adaptive federated relevance framework, namely FedRel, for spatial-temporal graph learning. The core Dynamic Inter-Intra Graph (DIIG) module in the framework is able to use these features to generate the spatial-temporal graphs. To improve the model generalization ability and performance while preserving the local data privacy, we also design a relevance-driven federated learning module.
  arXiv  Detail & Related papers  (2022-06-07T16:12:17Z)
• Positional Encoder Graph Neural Networks for Geographic Data [1.840220263320992]
  Graph neural networks (GNNs) provide a powerful and scalable solution for modeling continuous spatial data. In this paper, we propose PE-GNN, a new framework that incorporates spatial context and correlation explicitly into the models.
  arXiv  Detail & Related papers  (2021-11-19T10:41:49Z)
• Local Augmentation for Graph Neural Networks [78.48812244668017]
  We introduce the local augmentation, which enhances node features by its local subgraph structures. Based on the local augmentation, we further design a novel framework: LA-GNN, which can apply to any GNN models in a plug-and-play manner.
  arXiv  Detail & Related papers  (2021-09-08T18:10:08Z)
• On the spatial attention in Spatio-Temporal Graph Convolutional Networks for skeleton-based human action recognition [97.14064057840089]
  Graphal networks (GCNs) promising performance in skeleton-based human action recognition by modeling a sequence of skeletons as a graph. Most of the recently proposed G-temporal-based methods improve the performance by learning the graph structure at each layer of the network.
  arXiv  Detail & Related papers  (2020-11-07T19:03:04Z)
• Multi-Level Graph Convolutional Network with Automatic Graph Learning for Hyperspectral Image Classification [63.56018768401328]
  We propose a Multi-level Graph Convolutional Network (GCN) with Automatic Graph Learning method (MGCN-AGL) for HSI classification. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions. Our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level.
  arXiv  Detail & Related papers  (2020-09-19T09:26:20Z)
• Disentangling and Unifying Graph Convolutions for Skeleton-Based Action Recognition [79.33539539956186]
  We propose a simple method to disentangle multi-scale graph convolutions and a unified spatial-temporal graph convolutional operator named G3D. By coupling these proposals, we develop a powerful feature extractor named MS-G3D based on which our model outperforms previous state-of-the-art methods on three large-scale datasets.
  arXiv  Detail & Related papers  (2020-03-31T11:28:25Z)

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.