2018 IEEE 34th International Conference on Data Engineering (ICDE) (2018)

Paris, France

Apr 16, 2018 to Apr 19, 2018

ISSN: 2375-026X

ISBN: 978-1-5386-5520-7

pp: 617-628

ABSTRACT

Trajectory similarity computation is fundamental functionality with many applications such as animal migration pattern studies and vehicle trajectory mining to identify popular routes and similar drivers. While a trajectory is a continuous curve in some spatial domain, e.g., 2D Euclidean space, trajectories are often represented by point sequences. Existing approaches that compute similarity based on point matching suffer from the problem that they treat two different point sequences differently even when the sequences represent the same trajectory. This is particularly a problem when the point sequences are non-uniform, have low sampling rates, and have noisy points. We propose the first deep learning approach to learning representations of trajectories that is robust to low data quality, thus supporting accurate and efficient trajectory similarity computation and search. Experiments show that our method is capable of higher accuracy and is at least one order of magnitude faster than the state-of-the-art methods for k-nearest trajectory search.

INDEX TERMS

data mining, learning (artificial intelligence), search problems

CITATION

X. Li, K. Zhao, G. Cong, C. S. Jensen and W. Wei, "Deep Representation Learning for Trajectory Similarity Computation,"

*2018 IEEE 34th International Conference on Data Engineering (ICDE)*, Paris, France, 2018, pp. 617-628.

doi:10.1109/ICDE.2018.00062

CITATIONS

SEARCH