Early Abandon to Accelerate Exact Dynamic Time Warping

Early Abandon to Accelerate Exact  Dynamic Time Warping

Li Junkui and Wang Yuanzhen
College of Computer Science and Technology, University of Science and Technology, China

Abstract: Dynamic time warping is one of the important distance measures in similarity search of time series; however, the exact calculation of dynamic time warping has become a bottleneck. We propose an approach, named early abandon dynamic time warping, to accelerate the calculation. The method checks if values of the neighbouring cells in the cumulative distance matrix exceed the tolerance, and if so, it will terminate the calculation of the related cell. We demonstrate the idea of early abandon on dynamic time warping by theoretical analysis, and show the utilities of early abandon dynamic time warping by thorough empirical experiments performed both on synthetic datasets and real datasets. The results show, early abandon dynamic time warping outperforms the dynamic time warping calculation in the light of processing time, and is much better when the tolerance is below the real dynamic time warping distance.

Keywords: Data mining, time series, similarity search, dynamic time warping, early abandon.

Received July 8, 2007; accepted December 20, 2007

Read 5822 times Last modified on Wednesday, 20 January 2010 01:32
Share
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…