An OGS-based Dynamic Time Warping algorithm for time series data

Dynamic Time Warping (DTW) is a powerful technique in the time-series similarity search. However, its performance on large-scale data is unsatisfactory because of its high computational cost. Although many methods have been proposed to alleviate this, they are mostly indirect methods, i.e., they do not improve the DTW algorithm itself. In this paper, we propose to incorporate the Ordered Graph Search (OGS) and the lower bound for DTW into an improved DTW algorithm and apply it on time series data. Extensive experiments show that the improved DTW algorithm is faster than the original dynamic programming based algorithm on multi-dimensional time series data. It is also especially useful in the post-processing stage of searching in large time series data based on DTW distance.