Dynamic Time Warping
Dynamic Time Warping is a dynamic-programming-based time series similarity measure that computes the minimal cumulative distance between two sequences by optimally and nonlinearly aligning (warping) their time indices to allow local stretching and compression in the presence of temporal misalignment or differing lengths.
1.2K
Publications
88K
Citations
3.3K
Authors
1.2K
Institutions
Publications per year
2017–2026
444
Variants
Dtw
Parents
1.2K
Robust and fast similarity search for moving object trajectories
Lei Chen, M. TAMER ÖZSU, Vincent Oria · 2005 · 1.3K citations
1–5 of 1.2K
3.3K
32
h-index
13
h-index
11
h-index
11
h-index
11
h-index
1–5 of 3.3K
1.2K
University of California, Riverside
Riverside, United States
28 h-index
95 publications
23.8K citations

Chinese Academy of Sciences
Beijing, China
17 h-index
70 publications
2.4K citations

Centre National de la Recherche Scientifique
Paris, France
15 h-index
53 publications
1.9K citations
Stanford University
Stanford, United States
13 h-index
33 publications
2.5K citations

University of Alberta
Edmonton, Canada
13 h-index
17 publications
1.2K citations

Monash University
Melbourne, Australia
12 h-index
25 publications
2.2K citations
Carnegie Mellon University
Pittsburgh, United States
11 h-index
18 publications
2.2K citations

Harbin Institute of Technology
Harbin, China
10 h-index
29 publications
1.7K citations
1–8 of 1.2K
Repository · 29 publications · 2.4K citations
21
h-index
24 publications · 908 citations
18
h-index
TPAMI · 17 publications · 3.4K citations
17
h-index
22 publications · 1.5K citations
17
h-index
16 publications · 8.7K citations
16
h-index
1–5