A principled distributional approach to trajectory similarity measurement
Yufan Wang, Kai Ming Ting, Yuanyi Shang

TL;DR
This paper introduces a novel, computationally efficient distributional kernel method for trajectory similarity measurement that guarantees uniqueness and outperforms existing approaches in various applications.
Contribution
It is the first to apply a distributional kernel for trajectory representation and similarity, eliminating reliance on point-to-point distances and learning, with strong theoretical foundations.
Findings
Superior performance in trajectory anomaly detection
Faster runtime compared to existing methods
Effective in pattern mining and sub-trajectory detection
Abstract
Existing measures and representations for trajectories have two longstanding fundamental shortcomings, i.e., they are computationally expensive and they can not guarantee the `uniqueness' property of a distance function: dist(X,Y) = 0 if and only if X=Y, where and are two trajectories. This paper proposes a simple yet powerful way to represent trajectories and measure the similarity between two trajectories using a distributional kernel to address these shortcomings. It is a principled approach based on kernel mean embedding which has a strong theoretical underpinning. It has three distinctive features in comparison with existing approaches. (1) A distributional kernel is used for the very first time for trajectory representation and similarity measurement. (2) It does not rely on point-to-point distances which are used in most existing distances for trajectories. (3) It…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Time Series Analysis and Forecasting · Data Management and Algorithms
