A new k-DTW distance for polygonal curves combines Fréchet-like robustness with DTW-like flexibility, with exact and approximate algorithms plus dimension-free learning bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
A new k-DTW distance for polygonal curves combines Fréchet-like robustness with DTW-like flexibility, with exact and approximate algorithms plus dimension-free learning bounds.