Fast exact dynamic time warping on run-length encoded time series

DOI10.1007/s00453-022-01038-3zbMath1506.68185arXiv1903.03003OpenAlexW4288418917MaRDI QIDQ2684485

Vincent Froese, Mathias Weller, Brijnesh J. Jain, Maciej Rymar

Publication date: 16 February 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.03003

zbMATH Keywords

sparse datablock matrixline intersectionstime series similarity

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Analysis of algorithms (68W40)

Related Items (1)

Pattern matching under DTW distance

Cites Work

• Unnamed Item
• Which problems have strongly exponential complexity?
• Speeding up similarity search under dynamic time warping by pruning unpromising alignments
• A fully compressed algorithm for computing the edit distance of run-length encoded strings
• Faster STR-EC-LCS Computation
• Dynamic programming algorithm optimization for spoken word recognition
• Dynamic Time Warping and Geometric Edit Distance
• Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
• Dimensionality reduction for fast similarity search in large time series databases

This page was built for publication: Fast exact dynamic time warping on run-length encoded time series