K Nearest Neighbor-Guided Trajectory Similarity Learning

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Chang, Yanchuan, Cai, Xu, Jensen, Christian S., Qi, Jianzhong
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913929042591744
author Chang, Yanchuan
Cai, Xu
Jensen, Christian S.
Qi, Jianzhong
author_facet Chang, Yanchuan
Cai, Xu
Jensen, Christian S.
Qi, Jianzhong
contents Trajectory similarity is fundamental to many spatio-temporal data mining applications. Recent studies propose deep learning models to approximate conventional trajectory similarity measures, exploiting their fast inference time once trained. Although efficient inference has been reported, challenges remain in similarity approximation accuracy due to difficulties in trajectory granularity modeling and in exploiting similarity signals in the training data. To fill this gap, we propose TSMini, a highly effective trajectory similarity model with a sub-view modeling mechanism capable of learning multi-granularity trajectory patterns and a k nearest neighbor-based loss that guides TSMini to learn not only absolute similarity values between trajectories but also their relative similarity ranks. Together, these two innovations enable highly accurate trajectory similarity approximation. Experiments show that TSMini can outperform the state-of-the-art models by 22% in accuracy on average when learning trajectory similarity measures.
format Preprint
id arxiv_https___arxiv_org_abs_2502_00285
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle K Nearest Neighbor-Guided Trajectory Similarity Learning
Chang, Yanchuan
Cai, Xu
Jensen, Christian S.
Qi, Jianzhong
Machine Learning
Computer Vision and Pattern Recognition
Databases
Trajectory similarity is fundamental to many spatio-temporal data mining applications. Recent studies propose deep learning models to approximate conventional trajectory similarity measures, exploiting their fast inference time once trained. Although efficient inference has been reported, challenges remain in similarity approximation accuracy due to difficulties in trajectory granularity modeling and in exploiting similarity signals in the training data. To fill this gap, we propose TSMini, a highly effective trajectory similarity model with a sub-view modeling mechanism capable of learning multi-granularity trajectory patterns and a k nearest neighbor-based loss that guides TSMini to learn not only absolute similarity values between trajectories but also their relative similarity ranks. Together, these two innovations enable highly accurate trajectory similarity approximation. Experiments show that TSMini can outperform the state-of-the-art models by 22% in accuracy on average when learning trajectory similarity measures.
title K Nearest Neighbor-Guided Trajectory Similarity Learning
topic Machine Learning
Computer Vision and Pattern Recognition
Databases
url https://arxiv.org/abs/2502.00285