Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ahmadzadeh, Azim, Khazaei, Mahsa, Rohlfing, Elaina
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2510.21824
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866918171087208448
author Ahmadzadeh, Azim
Khazaei, Mahsa
Rohlfing, Elaina
author_facet Ahmadzadeh, Azim
Khazaei, Mahsa
Rohlfing, Elaina
contents Time series are high-dimensional and complex data objects, making their efficient search and indexing a longstanding challenge in data mining. Building on a recently introduced similarity measure, namely Multiscale Dubuc Distance (MDD), this paper investigates its comparative strengths and limitations relative to the widely used Dynamic Time Warping (DTW). MDD is novel in two key ways: it evaluates time series similarity across multiple temporal scales and avoids point-to-point alignment. We demonstrate that in many scenarios where MDD outperforms DTW, the gains are substantial, and we provide a detailed analysis of the specific performance gaps it addresses. We provide simulations, in addition to the 95 datasets from the UCR archive, to test our hypotheses. Finally, we apply both methods to a challenging real-world classification task and show that MDD yields a significant improvement over DTW, underscoring its practical utility.
format Preprint
id arxiv_https___arxiv_org_abs_2510_21824
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Beyond Point Matching: Evaluating Multiscale Dubuc Distance for Time Series Similarity
Ahmadzadeh, Azim
Khazaei, Mahsa
Rohlfing, Elaina
Machine Learning
Solar and Stellar Astrophysics
Time series are high-dimensional and complex data objects, making their efficient search and indexing a longstanding challenge in data mining. Building on a recently introduced similarity measure, namely Multiscale Dubuc Distance (MDD), this paper investigates its comparative strengths and limitations relative to the widely used Dynamic Time Warping (DTW). MDD is novel in two key ways: it evaluates time series similarity across multiple temporal scales and avoids point-to-point alignment. We demonstrate that in many scenarios where MDD outperforms DTW, the gains are substantial, and we provide a detailed analysis of the specific performance gaps it addresses. We provide simulations, in addition to the 95 datasets from the UCR archive, to test our hypotheses. Finally, we apply both methods to a challenging real-world classification task and show that MDD yields a significant improvement over DTW, underscoring its practical utility.
title Beyond Point Matching: Evaluating Multiscale Dubuc Distance for Time Series Similarity
topic Machine Learning
Solar and Stellar Astrophysics
url https://arxiv.org/abs/2510.21824