DeepAI AI Chat
Log In Sign Up

TC-DTW: Accelerating Multivariate Dynamic Time Warping Through Triangle Inequality and Point Clustering

by   Daniel Shen, et al.

Dynamic time warping (DTW) plays an important role in analytics on time series. Despite the large body of research on speeding up univariate DTW, the method for multivariate DTW has not been improved much in the last two decades. The most popular algorithm used today is still the one developed seventeen years ago. This paper presents a solution that, as far as we know, for the first time consistently outperforms the classic multivariate DTW algorithm across dataset sizes, series lengths, data dimensions, temporal window sizes, and machines. The new solution, named TC-DTW, introduces Triangle Inequality and Point Clustering into the algorithm design on lower bound calculations for multivariate DTW. In experiments on DTW-based nearest neighbor finding, the new solution avoids as much as 98 yields as much as 25X (7.5X average) speedups.


Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound

The Dynamic Time Warping (DTW) is a popular similarity measure between t...

Elastic bands across the path: A new framework and methods to lower bound DTW

There has been renewed recent interest in developing effective lower bou...

An Analytical Approach to Improving Time Warping on Multidimensional Time Series

Dynamic time warping (DTW) is one of the most used distance functions to...

Elastic Similarity Measures for Multivariate Time Series Classification

Elastic similarity measures are a class of similarity measures specifica...

Semi-Metrification of the Dynamic Time Warping Distance

The dynamic time warping (dtw) distance fails to satisfy the triangle in...

Benchmarking Multivariate Time Series Classification Algorithms

Time Series Classification (TSC) involved building predictive models for...

shapeDTW: shape Dynamic Time Warping

Dynamic Time Warping (DTW) is an algorithm to align temporal sequences w...