JOURNAL ARTICLE

Deep Trajectory Similarity Model: A Fast Method for Trajectory Similarity Computation

Abstract

Measuring trajectory similarity is a fundamental problem in the trajectory data mining field, and many similarity measurement methods had been proposed, such as dynamic time wrapping (DTW). However, these methods are dynamic programming problems, and dynamic programming problem usually leads to quadratic computational complexity. Thus, many acceleration algorithms were proposed. In this article, we proposed a deep neural network (DNN) based supervised similarity model, deep trajectory similarity model, to fit DTW similarity and to keep accuracy and orderliness. In the training process, we used low-frequency GPS trajectory data in Beijing as input data and used the DTW similarity of trajectory pairs as labels. In the test process, the model predicted the DTW similarity between two GPS trajectories. Experiments in this article indicated that deep trajectory similarity model could greatly decrease over 20% computation time than the acceleration algorithm of DTW similarity, FastDTW algorithm, and keep over 90% accuracy and over 97% orderliness. Experiments result indicated that the DTSM model has great potential in big data scenario.

Keywords:
Trajectory Similarity (geometry) Dynamic time warping Computer science Artificial intelligence Acceleration Computation Global Positioning System Artificial neural network Pattern recognition (psychology) Algorithm

Metrics

4
Cited By
0.49
FWCI (Field Weighted Citation Impact)
9
Refs
0.63
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Time Series Analysis and Forecasting
Physical Sciences →  Computer Science →  Signal Processing
Data Management and Algorithms
Physical Sciences →  Computer Science →  Signal Processing
Human Mobility and Location-Based Analysis
Social Sciences →  Social Sciences →  Transportation
© 2026 ScienceGate Book Chapters — All rights reserved.