Parameterizing the cost function of dynamic time warping with application to time series classification
Open Access
- 16 April 2023
- journal article
- research article
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 37 (5) , 2024-2045
Abstract
Dynamic time warping (DTW) is a popular time series distance measure that aligns the points in two series with one another. These alignments support warping of the time dimension to allow for processes that unfold at differing rates. The distance is the minimum sum of costs of the resulting alignments over any allowable warping of the time dimension. The cost of an alignment of two points is a function of the difference in the values of those points. The original cost function was the absolute value of this difference. Other cost functions have been proposed. A popular alternative is the square of the difference. However, to our knowledge, this is the first investigation of both the relative impacts of using different cost functions and the potential to tune cost functions to different time series classification tasks. We do so in this paper by using a tunable cost function $$\lambda _{\gamma }$$ with parameter $$\gamma $$ . We show that higher values of $$\gamma $$ place greater weight on larger pairwise differences, while lower values place greater weight on smaller pairwise differences. We demonstrate that training $$\gamma $$ significantly improves the accuracy of both the $${ DTW }$$ nearest neighbor and Proximity Forest classifiers.
Keywords
All Related Versions
Funding Information
- Australian Research Council (DP210100072)
This publication has 39 references indexed in Scilit:
- Searching and mining trillions of time series subsequences under dynamic time warping2012
- Weighted dynamic time warping for time series classificationPattern Recognition, 2011
- A global averaging method for dynamic time warping, with applications to clusteringPattern Recognition, 2011
- Exact indexing of dynamic time warpingKnowledge and Information Systems, 2005
- Making Time-series Classification More Accurate Using Learned Constraints2004
- On The Marriage of Lp-norms and Edit Distance2004
- Derivative Dynamic Time Warping2001
- Dynamic programming algorithm optimization for spoken word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- Minimum prediction residual principle applied to speech recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975