Proceedings Article10.48786/edbt.2023.12
Spatial Structure-Aware Road Network Embedding via Graph Contrastive Learning
Yanchuan Chang,Egemen Tanin,Xin Cao,Jianzhong Qi +3 more
pp 144-156
15
TL;DR: Experimental results on three downstream tasks over real-world road networks show that SARN outperforms state-of-the-art self-supervised models consistently and achieves comparable (or even better) performance to supervised models.
read more
Abstract: Road networks are widely used as a fundamental structure in urban transportation studies. In recent years, with more research leveraging deep learning to solve conventional transportation problems, how to obtain robust road network representations (i.e., embeddings) applicable for a wide range of applications became a fundamental need. Existing studies mainly adopt graph embedding methods. Such methods, however, foremost learn the topological correlations of road networks but ignore the spatial structure (i.e., spatial correlations) which are also important in applications such as querying similar trajectories. Besides, most studies learn task-specic embeddings in a supervised manner such that the embeddings are sub-optimal when being used for new tasks. It is inecient to store or learn dedicated embeddings for every dierent task in a large transportation system. To tackle these issues, we propose a model named SARN to learn generic and task-agnostic road network embeddings based on self-supervised contrastive learning. We present (i) a spatial similarity matrix to help learn the spatial correlations of the roads, (ii) a sampling strategy based on the spatial structure of a road network to form self-supervised training samples, and (iii) a two-level loss function to guide SARN to learn embeddings based on both local and global contrasts of similar and dissimilar road segments. Experimental results on three downstream tasks over real-world road networks show that SARN outperforms state-of-the-art self-supervised models consistently and achieves comparable (or even better) performance to supervised models.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Towards Efficient and Comprehensive Urban Spatial-Temporal Prediction: A Unified Library and Performance Benchmark
27 Apr 2023
TL;DR: In this article , the authors provide a comprehensive review of urban spatial-temporal prediction and propose a unified storage format for spatial-time data called atomic files, which can be used to compare different models and components.
7
MaaSDB: Spatial Databases in the Era of Large Language Models (Vision Paper)
Jianzhong Qi,Zuqing Li,Egemen Tanin +2 more
TL;DR: This work envisage an LLM-based spatial database system to learn from both structured and unstructured spatial data, which will offer seamless access to spatial knowledge for the users, thus benefiting individuals, business, and government policy makers alike.
Towards Efficient and Comprehensive Urban Spatial-Temporal Prediction: A Unified Library and Performance Benchmark
TL;DR: In this paper , the authors provide a comprehensive review of urban spatial-temporal prediction and propose a unified storage format for spatialtemporal data called atomic files, which can be used to compare different models and components.
Reinforcement Learning based Tree Decomposition for Distance Querying in Road Networks
Bolong Zheng,Yong Ma,Jing Xian Wan,Yongyong Gao,Kai Huang,Xiaofang Zhou,Christian S. Jensen +6 more
- 01 Apr 2023
TL;DR: A reinforcement learning based tree decomposition (RLTD) approach that reduces the space overhead significantly and achieves on average about 14% speedup for queries with almost the same preprocessing time when compared with the state-of-the-art proposals.
2
Jointly Learning Representations for Map Entities via Heterogeneous Graph Contrastive Learning
Jiawei Jiang,Yifan Yang,Jingyuan Wang,Junjie Wu +3 more
TL;DR: The proposed HOME-GCL is the first attempt to jointly learn representations for road segments and land parcels using a unified model and introduces two types of contrastive learning tasks, namely intra-entity and inter-entity tasks, to train the encoder in a self-supervised manner.
2
References
•Proceedings Article
Efficient Estimation of Word Representations in Vector Space
Tomas Mikolov,Kai Chen,Greg S. Corrado,Jeffrey Dean +3 more
- 16 Jan 2013
TL;DR: Two novel model architectures for computing continuous vector representations of words from very large data sets are proposed and it is shown that these vectors provide state-of-the-art performance on the authors' test set for measuring syntactic and semantic word similarities.
27.5K
•Posted Content
A Simple Framework for Contrastive Learning of Visual Representations
TL;DR: It is shown that composition of data augmentations plays a critical role in defining effective predictive tasks, and introducing a learnable nonlinear transformation between the representation and the contrastive loss substantially improves the quality of the learned representations, and contrastive learning benefits from larger batch sizes and more training steps compared to supervised learning.
Graph Attention Networks
Petar Veličković,Guillem Cucurull,Arantxa Casanova,Adriana Romero,Pietro Liò,Yoshua Bengio +5 more
- 15 Feb 2018
TL;DR: Graph Attention Networks (GATs) as mentioned in this paper leverage masked self-attentional layers to address the shortcomings of prior methods based on graph convolutions or their approximations.
•Posted Content
Inductive Representation Learning on Large Graphs
TL;DR: GraphSAGE is presented, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data and outperforms strong baselines on three inductive node-classification benchmarks.
11.9K
DeepWalk: online learning of social representations
Bryan Perozzi,Rami Al-Rfou,Steven Skiena +2 more
- 24 Aug 2014
TL;DR: DeepWalk as mentioned in this paper uses local information obtained from truncated random walks to learn latent representations by treating walks as the equivalent of sentences, which encode social relations in a continuous vector space, which is easily exploited by statistical models.