Abstract

In time series mining, the Dynamic Time Warping (DTW) distance is a commonly and widely used similarity measure. Since the computational complexity of the DTW distance is quadratic, various kinds of warping constraints, lower bounds and abstractions have been developed to speed up time series mining under DTW distance. In this contribution, we propose a novel Lucky Time Warping (LTW) distance, with linear time and space complexity, which uses a greedy algorithm to accelerate distance calculations for nearest neighbor classification. The results show that, compared to the Euclidean distance (ED) and (un)constrained DTW distance, our LTW distance trades classification accuracy against computational cost reasonably well, and therefore can be used as a fast alternative for nearest neighbor time series classification.

@inproceedings{Spiegel14a,
author 			= {Stephan Spiegel and Brijnesh-Johannes Jain and Sahin Albayrak},
title			= {Fast Time Series Classification under Lucky Time Warping Distance},
booktitle		= {Proceedings of 29th Symposium on Applied Computing (SAC)},
year 			= {2014},
numpages			= {8},
location 		= {Gyeongju, Korea},
publisher		= {ACM},
doi                     = {10.1145/2554850.2554885}
}