SGED-Net: A Self-organizing Graph Embedding Deep Network for Travel Time Estimation

Published: 01 Jan 2023, Last Modified: 13 May 2025IJCNN 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In recent years, the travel time prediction has been receiving sustained attention because of the prevalence of location based applications, smart city engineering and online car-hailing. In this paper, a Self-organizing Graph Embedding Deep Network (SGED-Net) model is proposed to address the challenging Origin-Destination(OD) based travel time estimation (TTE). Specifically, SGED-Net comprises four modules, involving travel feature extraction, spatial association graph generation, graph embedding, and travel time deep learning prediction modules. First, we comprehensively extract three travel characteristics and feed them into a modified LightGBM component for learning the importance sort of features for different trips. Second, considering the lack of intermediate trajectories in the OD-based TTE, we employ a self-organizing feature mapping (SOM) approach to obtain the prominent nodes among pick-up and drop-off locations. Meanwhile clustering algorithm is used to divide a city into n-clusters districts of variant sizes. The topology learned by SOM is combined with the districts divided by clustering algorithm to obtain a district-based spatial association graph. Moreover, an improved SDNE algorithm is leveraged to gain a low-dimension spatial association representation while preserving the global and local structure of the graph. Then, we design a deep neural network for learning the captured spatial association representation. Finally, a series of experiments in two real-world large-scale datasets demonstrate the SGED-Net's excellent performance.
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview