An average-compress algorithm for the sample mean problem under dynamic time warping

DOI10.1007/s10898-023-01294-9arXiv1909.13541OpenAlexW2977203405MaRDI QIDQ6164020

No author found.

Publication date: 26 July 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonconvex optimizationheuristictime series averagingFréchet function

Mathematics Subject Classification ID

Economic time series analysis (91B84) Nonconvex programming, global optimization (90C26)

Cites Work

• A global averaging method for dynamic time warping, with applications to clustering
• Generalized median graph computation by means of graph embedding in vector spaces
• Sufficient conditions for the existence of a sample mean of time series under dynamic time warping
• Exact mean computation in dynamic time warping spaces
• A review on distance based time series classification
• Statistical graph space analysis
• Object oriented data analysis: sets of trees
• Overview of object oriented data analysis
• On the approximation of curves by line segments using dynamic programming
• Shape Manifolds, Procrustean Metrics, and Complex Projective Spaces
• Dynamic programming algorithm optimization for spoken word recognition
• Adaptive Global Time Sequence Averaging Method Using Dynamic Time Warping
• Tight Hardness Results for Consensus Problems on Circular Strings and Time Series
• Nonparametric Inference on Manifolds
• Dimensionality reduction for fast similarity search in large time series databases
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An average-compress algorithm for the sample mean problem under dynamic time warping