Papers › Early Abandoning and Pruning for Elastic Distances including Dynamic Time Warping

Early Abandoning and Pruning for Elastic Distances including Dynamic Time Warping

10 Feb 2021arXiv:2102.05221archive 2025-07-28

Matthieu Herrmann, Geoffrey I. Webb

Nearest neighbor search under elastic distances is a key tool for time series analysis, supporting many applications. However, straightforward implementations of distances require O(n²) space and time complexities, preventing these applications from scaling to long series. Much work has been devoted to speeding up the NN search process, mostly with the development of lower bounds, allowing to avoid costly distance computations when a given threshold is exceeded. This threshold, provided by the similarity search process, also allows to early abandon the computation of a distance itself. Another approach, is to prune parts of the computation. All these techniques are othogonal to each other. In this work, we develop a new generic strategy, "EAPruned", that tightly integrates pruning with early abandoning. We apply it to six elastic distance measures: DTW, CDTW, WDTW, ERP, MSM and TWE, showing substantial speedup in NN search applications. Pruning alone also shows substantial speedup for some distances, benefiting applications beyond the scope of NN search (e.g. requiring all pairwise distances), and hence where early abandoning is not applicable. We~release our implementation as part of a new C++ library for time series classification, along with easy to use Python/Numpy bindings.

PaperPDFCode

Code

MonashTS/tempo officialmentioned in papermentioned on GitHubBSD-3-Clause report
HerrmannM/paper-2021-EAPElasticDist officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

ClusteringDynamic Time WarpingERPTime SeriesTime Series AnalysisTime Series Classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

DTWPruning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections