Proceedings of the 2015 SIAM International Conference on Data Mining 2015
DOI: 10.1137/1.9781611974010.33
|View full text |Cite
|
Sign up to set email alerts
|

On the Non-Trivial Generalization of Dynamic Time Warping to the Multi-Dimensional Case

Abstract: In the last decade, Dynamic Time Warping (DTW) has emerged as the distance measure of choice for virtually all time series data mining applications. This is the result of significant progress in improving DTW's efficiency, and multiple empirical studies showing that DTW-based classifiers at least equal the accuracy of all their rivals across dozens of datasets. Thus far, most of the research has considered only the one-dimensional case, with practitioners generalizing to the multi-dimensional case in one of tw… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
54
0
1

Year Published

2016
2016
2022
2022

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 99 publications
(57 citation statements)
references
References 15 publications
2
54
0
1
Order By: Relevance
“…To address the two technical challenges, background noise and multi-dimensional data (with different length in each dimension), we adopted an extended DTW algorithm [58], which extends the original DTW algorithm to multi-dimensional time series. The multi-dimensional DTW, denoted DTW_I, calculates DTW distance for each feature separately, and sums up each DTW distance after normalization.…”
Section: A Attack Methodsmentioning
confidence: 99%
“…To address the two technical challenges, background noise and multi-dimensional data (with different length in each dimension), we adopted an extended DTW algorithm [58], which extends the original DTW algorithm to multi-dimensional time series. The multi-dimensional DTW, denoted DTW_I, calculates DTW distance for each feature separately, and sums up each DTW distance after normalization.…”
Section: A Attack Methodsmentioning
confidence: 99%
“…Energies 2016, 9, 561 6 of 11 DTW utilizes dynamic programming to find the optimal mapping of points in two sequences and compute the distance between them. Detailed steps for computing the DTW distance can be found in several papers [20,21], and efficient algorithms can be found in [17].…”
Section: Dtw Distancementioning
confidence: 99%
“…Note that for the remainder of this article, we use the terms distance and similarity interchangeably, as the former is simply the inverse of the latter. We have chosen the Dynamic Time Warping (DTW) algorithm 6,7 to measure the distance between two time-series of a given WITI factor. DTW is an algorithm for computing the distance between two time-series that can be tuned to overlook slight differences in the rates or speeds at which the time-series evolve.…”
Section: Iia1 Generating Representative Witi Patterns Via Similarimentioning
confidence: 99%