Efficient Trajectory Similarity Computation with Contrastive Learning

被引:21
作者
Deng, Liwei [1 ]
Zhao, Yan [2 ]
Fu, Zidan [1 ]
Sun, Hao [3 ]
Liu, Shuncheng [1 ]
Zheng, Kai [1 ]
机构
[1] Univ Elect Sci & Technol China, Chengdu, Peoples R China
[2] Aalborg Univ, Aalborg, Denmark
[3] Peking Univ, Beijing, Peoples R China
来源
PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022 | 2022年
关键词
Trajectory Similarity Computation; Contrastive Learning; Efficiency;
D O I
10.1145/3511808.3557308
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The ubiquity of mobile devices and the accompanying deployment of sensing technologies have resulted in a massive amount of trajectory data. One important fundamental task is trajectory similarity computation, which is to determine how similar two trajectories are. To enable effective and efficient trajectory similarity computation, we propose a novel robust model, namely Contrastive Learning based Trajectory Similarity Computation (CL-TSim). Specifically, we employ a contrastive learning mechanism to learn the latent representations of trajectories and then calculate the dissimilarity between trajectories based on these representations. Compared with sequential auto-encoders that are the mainstream deep learning architectures for trajectory similarity computation, CL-TSim does not require a decoder and step-by-step reconstruction, thus improving the training efficiency significantly. Moreover, considering the non-uniform sampling rate and noisy points in trajectories, we adopt two type of augmentations, i.e., point dowm-sampling and point distorting, to enhance the robustness of the proposed model. Extensive experiments are conducted on two widely-used real-world datasets, i.e., Porto and ChengDu, which demonstrate the superior effectiveness and efficiency of the proposed model.
引用
收藏
页码:365 / 374
页数:10
相关论文
共 40 条
[1]   Subtrajectory Clustering: Models and Algorithms [J].
Agarwal, Pankaj K. ;
Fox, Kyle ;
Munagala, Kamesh ;
Nath, Abhinandan ;
Pan, Jiangwei ;
Taylor, Erin .
PODS'18: PROCEEDINGS OF THE 37TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2018, :75-87
[2]   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
[3]  
Chen L., 2005, P 2005 ACM SIGMOD IN, P491, DOI DOI 10.1145/1066157.1066213
[4]   Modeling Spatial Trajectories With Attribute Representation Learning [J].
Chen, Meng ;
Zhao, Yan ;
Liu, Yang ;
Yu, Xiaohui ;
Zheng, Kai .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (04) :1902-1914
[5]  
Chen T, 2020, Arxiv, DOI arXiv:2002.05709
[6]  
Chen T, 2020, Arxiv, DOI arXiv:2006.10029
[7]  
Chen XL, 2020, Arxiv, DOI arXiv:2003.04297
[8]  
Chen XL, 2020, Arxiv, DOI arXiv:2011.10566
[9]   Casper: Query Processing for Location Services without Compromising Privacy [J].
Chow, Chi-Yin ;
Mokbel, Mohamed F. ;
Aref, Walid G. .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2009, 34 (04)
[10]   Sequential-Knowledge-Aware Next POI Recommendation: A Meta-Learning Approach [J].
Cui, Yue ;
Sun, Hao ;
Zhao, Yan ;
Yin, Hongzhi ;
Zheng, Kai .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2022, 40 (02)