How meaningful are similarities in deep trajectory representations?

被引:7
作者
Taghizadeh, Saeed [1 ]
Elekes, Abel [1 ]
Schaeler, Martin [1 ]
Boehm, Klemens [1 ]
机构
[1] Karlsruhe Inst Technol, D-76131 Karlsruhe, Germany
关键词
Trajectory similarity; Trajectory embedding models; Moving object databases; Trajectory databases; Trajectory clustering; Deep learning; MOVEMENT;
D O I
10.1016/j.is.2019.101452
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Finding similar trajectories is an important task in moving object databases. However, classical similarity models face several limitations, including scalability and robustness. Recently, an approach named t2vec proposed transforming trajectories into points in a high dimensional vector space, and this transformation approximately keeps distances between trajectories. t2vec overcomes that scalability limitation: Now it is possible to cluster millions of trajectories. However, the semantics of the learned similarity values - and whether they are meaningful - is an open issue. One can ask: How does the configuration of t2vec affect the similarity values of trajectories? Is the notion of similarity in t2vec similar, different, or even superior to existing models? As for any neural-network-based approach, inspecting the network does not help to answer these questions. So the problem we address in this paper is how to assess the meaningfulness of similarity in deep trajectory representations. Our solution is a methodology based on a set of well-defined, systematic experiments. We compare t2vec to classical models in terms of robustness and their semantics of similarity, using two real-world datasets. We give recommendations which model to use in possible application scenarios and use cases. We conclude that using t2vec in combination with classical models may be the best way to identify similar trajectories. Finally, to foster scientific advancement, we give the public access to all trained t2vec models and experiment scripts. To our knowledge, this is the biggest collection of its kind. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:14
相关论文
共 51 条
[1]   COMPUTING THE FRECHET DISTANCE BETWEEN 2 POLYGONAL CURVES [J].
ALT, H ;
GODAU, M .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (1-2) :75-91
[2]  
[Anonymous], 2004, Proceedings of the Thirtieth International Conference on Very Large Data Bases, DOI DOI 10.1016/B978-012088469-8.50070-X
[3]  
[Anonymous], 2005, P ACM SIGMOD INT C M, P491
[4]  
Berndt Donald J, 1994, KDD WORKSH, V10, P359
[5]  
Besse P., ARXIV150804904
[6]  
Cadez I. V., 2000, Proceedings. KDD-2000. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P140, DOI 10.1145/347090.347119
[7]  
Chen ZB, 2011, PROC INT CONF DATA, P900, DOI 10.1109/ICDE.2011.5767890
[8]  
Co-Reyes J.D., 2018, ARXIV180602813
[9]  
Collobert R, 2011, J MACH LEARN RES, V12, P2493
[10]  
Devlin J, 2014, PROCEEDINGS OF THE 52ND ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 1, P1370