Optimizing Dynamic Time Warping’s Window Width for Time Series Data Mining Applications

Dau, Hoang Anh, Silva, Diego Furtado, Petitjean, Francois, Forestier, Germain, Bagnall, Anthony, Mueen, Abdullah and Keogh, Eamonn (2018) Optimizing Dynamic Time Warping’s Window Width for Time Series Data Mining Applications. Data Mining and Knowledge Discovery, 32 (4). 1074–1120. ISSN 1384-5810

[img]
Preview
PDF (Accepted_manuscript) - Submitted Version
Download (871kB) | Preview

Abstract

Dynamic Time Warping (DTW) is a highly competitive distance measure for most time series data mining problems. Obtaining the best performance from DTW requires setting its only parameter, the maximum amount of warping (w). In the supervised case with ample data, w is typically set by cross-validation in the training stage. However, this method is likely to yield suboptimal results for small training sets. For the unsupervised case, learning via cross-validation is not possible because we do not have access to labeled data. Many practitioners have thus resorted to assuming that “the larger the better”, and they use the largest value of w permitted by the computational resources. However, as we will show, in most circumstances, this is a naïve approach that produces inferior clusterings. Moreover, the best warping window width is generally non-transferable between the two tasks, i.e., for a single dataset, practitioners cannot simply apply the best w learned for classification on clustering or vice versa. In addition, we will demonstrate that the appropriate amount of warping not only depends on the data structure, but also on the dataset size. Thus, even if a practitioner knows the best setting for a given dataset, they will likely be at a lost if they apply that setting on a bigger size version of that data. All these issues seem largely unknown or at least unappreciated in the community. In this work, we demonstrate the importance of setting DTW’s warping window width correctly, and we also propose novel methods to learn this parameter in both supervised and unsupervised settings. The algorithms we propose to learn w can produce significant improvements in classification accuracy and clustering quality. We demonstrate the correctness of our novel observations and the utility of our ideas by testing them with more than one hundred publicly available datasets. Our forceful results allow us to make a perhaps unexpected claim; an underappreciated “low hanging fruit” in optimizing DTW’s performance can produce improvements that make it an even stronger baseline, closing most or all the improvement gap of the more sophisticated methods proposed in recent years.

Item Type: Article
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: Pure Connector
Date Deposited: 04 Apr 2018 14:34
Last Modified: 04 Oct 2020 23:53
URI: https://ueaeprints.uea.ac.uk/id/eprint/66665
DOI: 10.1007/s10618-018-0565-y

Actions (login required)

View Item View Item