返回
Long-term sequence dependency capture for spatiotemporal graph modeling
DOI:10.1016/j.knosys.2023.110818.png)
摘要
En 中文
Long term dependency capture is essentially important for time series prediction and spatial-temporal forecasting. In recent years, many deep learning-based forecasting methods have been proposed, leading to rapid development in this area. We systematically reviewed long-term dependency capture methods, including temporal dependency in sequence (named intra-sequence temporal dependency), temporal dependency out of sequence (named inter-sequence temporal dependency, in this scenario the long-term dependencies are split by many subsequences). Because the batch technique is widely adopted in machine learning and deep learning, the range of temporal capturing ability for many proposed methods is intra-sequence temporal dependency, which limits the capacity of long-term dependency capture. Aiming at the above problems, we designed three type memory mechanisms (i.e., a temporal encoding memory mechanism, a cross-sequence memory mechanism and a query -key based memory mechanism) to solve those long term dependency problems. Moreover, based on the cross-sequence memory mechanism and query-key architecture, an Attention-based Long -Term Dependency Capture model (ALTDC) is proposed for long-term dependency modeling and further solves the temporal dependency coherence problem. ALTDC includes temporal Transformer and spatial Transformer. The temporal Transformer adopts multi-head attention mechanism in temporal dimension and takes into consideration the relative position encoding. The spatial Transformer leverages attention mechanism in spatial dimension, and utilizes learnable position encoding and graph convolution to capture spatial relationships. Experiments demonstrate that the proposed model outperforms the state-of-art baselines on real world time-series datasets and spatial-temporal datasets.(c) 2023 Elsevier B.V. All rights reserved.
Keyword:
Long-term dependency
Smart city
Spatial temporal forecasting
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Graph attention network with dynamic representation of relations for knowledge graph completion具有动态关系表示的图注意网络用于知识图补全
Unrestricted multi-hop reasoning network for interpretable question answering over knowledge graph基于知识图的可解释性问题回答的无限制多跳推理网络

