Exact mean computation in dynamic time warping spaces

DOI10.1007/s10618-018-0604-8zbMath1458.62196arXiv1710.08937OpenAlexW2963332138WikidataQ128825205 ScholiaQ128825205MaRDI QIDQ2218328

Yanyan Li

Publication date: 15 January 2021

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingtime series analysisFréchet functionexact exponential-time algorithmempirical evaluation of heuristics

Mathematics Subject Classification ID

Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40)

Related Items (4)

Sufficient conditions for the existence of a sample mean of time series under dynamic time warping ⋮ An average-compress algorithm for the sample mean problem under dynamic time warping ⋮ Approximating length-restricted means under dynamic time warping ⋮ Tight Hardness Results for Consensus Problems on Circular Strings and Time Series

Uses Software

• GitHub
• DBA
• soft-DTW

Cites Work

• A global averaging method for dynamic time warping, with applications to clustering
• Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment
• Hardness results for the center and median string problems under the weighted and unweighted edit distances
• Dynamic programming algorithm optimization for spoken word recognition
• Algorithms on Strings, Trees and Sequences
• Dynamic Time Warping and Geometric Edit Distance
• Fast and Accurate Time-Series Clustering
• The complexity of multiple sequence alignment with SP-score that is a metric
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact mean computation in dynamic time warping spaces