Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2000
DOI: 10.1145/347090.347153
|View full text |Cite
|
Sign up to set email alerts
|

Scaling up dynamic time warping for datamining applications

Abstract: There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of Euclidean distance is used. However, as we demonstrate in this paper, Euclidean distance can be an extremely brittle distance measure. Dynamic time warping (DTW) has been suggested as a technique to allow more robust distance calculations, however it is computationally expensive. In this paper we introduce a modification of DTW which … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
338
0
1

Year Published

2009
2009
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 655 publications
(353 citation statements)
references
References 11 publications
1
338
0
1
Order By: Relevance
“…The metric builds an optimal alignment of points among two time series by dynamically constructing a progressive cost matrix. It computes the the path of the minimal overall point pairs' distance [2]. Adding warping window size constraints have been reported to occasionally boost the classification [16].…”
Section: Time Series Classificationmentioning
confidence: 99%
See 1 more Smart Citation
“…The metric builds an optimal alignment of points among two time series by dynamically constructing a progressive cost matrix. It computes the the path of the minimal overall point pairs' distance [2]. Adding warping window size constraints have been reported to occasionally boost the classification [16].…”
Section: Time Series Classificationmentioning
confidence: 99%
“…The generality of interest is influenced by the large number of problems involving time series, ranging from financial econometrics up to medical diagnosis [1]. The most widely applied time series classifier is the nearest neighbor (NN) empowered with a similarity/distance metric called Dynamic Time Warping (DTW), hereafter jointly denoted as DTW-NN [2]. Due to the accuracy of DTW in detecting pattern variations, DTW-NN has been characterized as a hard-to-beat baseline [3].…”
Section: Introductionmentioning
confidence: 99%
“…Recent data mining research has focused on using specialised similarity measures such as dynamic time warping (DTW) [5] in conjunction with lazy classifiers [4] to capture both correlation based and shape based similarity. DTW is is a natural generalisation of using Euclidean distance based methods and is often seen as a means of compensating against slight phase shift rather than capturing phase independent similarity.…”
Section: Time Series Classificationmentioning
confidence: 99%
“…One of the most surprising recent results is, however, that the simple 1-nearest neighbor (1-NN) classifier using dynamic time warping (DTW) distance [15] has been shown to be competitive or superior to many state-of-the art time-series classification methods [6], [9], [13]. These results inspired intensive research of DTW in the last decade: this method has been examined in depth (for a thorough summary of results see [11]), while the improvements in its accuracy [2], [12] and efficiency [10] allowed to apply it to large, real-word recognition problems.…”
Section: Introductionmentioning
confidence: 99%