mlsanityData to 7 Oct 2026

Amercing: An Intuitive, Elegant and Effective Constraint for Dynamic Time Warping

arXiv 2111.13314 ↗First posted 26 Nov 2021cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Dynamic Time Warping (DTW), and its constrained (CDTW) and weighted (WDTW) variants, are time series distances with a wide range of applications. They minimize the cost of non-linear alignments between series. CDTW and WDTW have been introduced because DTW is too permissive in its alignments. However, CDTW uses a crude step function, allowing unconstrained flexibility within the window, and none beyond it. WDTW's multiplicative weight is relative to the distances between aligned points along a warped path, rather than being a direct function of the amount of warping that is introduced. In this paper, we introduce Amerced Dynamic Time Warping (ADTW), a new, intuitive, DTW variant that penalizes the act of warping by a fixed additive cost. Like CDTW and WDTW, ADTW constrains the amount of warping. However, it avoids both abrupt discontinuities in the amount of warping allowed and the limitations of a multiplicative penalty. We formally introduce ADTW, prove some of its properties, and discuss its parameterization. We show on a simple example how it can be parameterized to achieve an intuitive outcome, and demonstrate its usefulness on a standard time series classification benchmark. We provide a demonstration application in C++.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 26 references that are in the map. First posted on arXiv 26 Nov 2021.

Builds on

5 of 26 references.

References · 5

  1. 2018The UCR Time Series Archivecited by 421
  2. 2019TS-CHIEF: A Scalable and Accurate Forest Algorithm for Time Series Classificationcited by 67
  3. 2018Proximity Forest: An effective and scalable distance-based classifier for time seriescited by 46
  4. 2020Improving the Accuracy of Global Forecasting Models using Time Series Data Augmentationcited by 31
  5. 2021Early Abandoning and Pruning for Elastic Distances including Dynamic Time Warpingcited by 3

Built on by

Cited by year

Citing papers per year: 2023: 2.

2 papers.