Jointly spatial-temporal representation learning for individual trajectories
Not on the map. Why?
Abstract (arXiv)
Individual trajectories, rich in human-environment interaction information across space and time, serve as vital inputs for geospatial foundation models (GeoFMs). However, existing attempts at learning trajectory representations have overlooked the implicit spatial-temporal dependency within trajectories, failing to encode such dependency in a deep learning-friendly format. That poses a challenge in obtaining general-purpose trajectory representations. Therefore, this paper proposes a spatial-temporal joint representation learning method (ST-GraphRL) to formalize learnable spatial-temporal dependencies into trajectory representations. The proposed ST-GraphRL consists of three compositions: (i) a weighted directed spatial-temporal graph to explicitly construct mobility interactions in both space and time dimensions; (ii) a two-stage jointly encoder (i.e., decoupling and fusion), to learn entangled spatial-temporal dependencies by independently decomposing and jointly aggregating space and time information; (iii) a decoder guides ST-GraphRL to learn explicit mobility regularities by simulating the spatial-temporal distributions of trajectories. Tested on three real-world human mobility datasets, the proposed ST-GraphRL outperformed all the baseline models in predicting movement spatial-temporal distributions and preserving trajectory similarity with high spatial-temporal correlations. Analyzing spatial-temporal features presented in latent space validates that ST-GraphRL understands spatial-temporal patterns. This study may also benefit representation learnings of other geospatial data to achieve general-purpose data representations and advance GeoFMs development.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 68 references that are in the map. First posted on arXiv 7 Dec 2023.
Builds on
22 of 68 references.
References · 22
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
- 2018Deep Graph Infomaxcited by 1,101
- 2020DeeperGCN: All You Need to Train Deeper GCNscited by 249
- 2021Self-Supervised Representation Learning: Introduction, Advances and Challengescited by 147
- 2020Distribution-Balanced Loss for Multi-Label Classification in Long-Tailed Datasetscited by 122
- 2020Multi-Scale Representation Learning for Spatial Feature Distributions using Grid Cellscited by 88
- 2022Self-supervised Trajectory Representation Learning with Temporal Regularities and Travel Semanticscited by 58
10 more
- 2020LSTM-TrajGAN: A Deep Learning Approach to Trajectory Privacy Protectioncited by 57
- 2021A Review of Location Encoding for GeoAI: Methods and Applicationscited by 53
- 2021Unsupervised Path Representation Learning with Curriculum Negative Samplingcited by 42
- 2023GeoGPT: Understanding and Processing Geospatial Tasks through An Autonomous GPTcited by 40
- 2021Deep Spatially and Temporally Aware Similarity Computation for Road Network Constrained Trajectoriescited by 29
- 2020Learning Geo-Contextual Embeddings for Commuting Flow Predictioncited by 27
- 2021Reinforced Imitative Graph Representation Learning for Mobile User Profiling: An Adversarial Training Perspectivecited by 21
- 2023CATS: Conditional Adversarial Trajectory Synthesis for Privacy-Preserving Trajectory Data Publication Using Deep Learning Approachescited by 6
- 2020Unsupervised embedding of trajectories captures the latent structure of scientific migrationcited by 3
- 2020Learning Behavioral Representations of Human Mobilitycited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.