Metraipolis › archive › dc_df2f88d2907d
Dynamic time warping — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Dynamic_time_warping
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T12:55:44.303Z
- SHA-256 of the archived text
f720bea2275f2f9a87c988b29b2e0c254e112b02bdc124dab2295b5cada55cf8- Stable URL of this page
https://metraipolis.com/documento/dc_df2f88d2907d
How to cite
Dynamic time warping — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Dynamic_time_warping (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_df2f88d2907d (Metraipolis archive dc_df2f88d2907d, sha256 f720bea2275f2f9a87c988b29b2e0c254e112b02bdc124dab2295b5cada55cf8)
BibTeX
@misc{dcdf2f88d2907d,
title = {Dynamic time warping — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Dynamic_time_warping},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_df2f88d2907d; sha256 f720bea2275f2f9a87c988b29b2e0c254e112b02bdc124dab2295b5cada55cf8},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Dynamic_time_warping. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In time series analysis, dynamic time warping (DTW) is an algorithm for measuring similarity between two temporal sequences, which may vary in speed. For instance, similarities in walking could be detected using DTW, even if one person was walking faster than the other, or if there were accelerations and decelerations during the course of an observation. DTW has been applied to temporal sequences of video, audio, and graphics data — indeed, any data that can be turned into a one-dimensional sequence can be analyzed with DTW. A well-known application has been automatic speech recognition, to cope with different speaking speeds. Other applications include speaker recognition and online signature recognition. It can also be used in partial shape matching applications. In general, DTW is a method that calculates an optimal match between two given sequences (e.g. time series) with certain restriction and rules: Every index from the first sequence must be matched with one or more indices from the other sequence, and vice versa The first index from the first sequence must be matched with the first index from the other sequence (but it does not have to be its only match) The last index from the first sequence must be matched with the last index from the other sequence (but it does not have to be its only match) The mapping of the indices from the first sequence to indices from the other sequence must be monotonically increasing, and vice versa, i.e. if j > i {\displaystyle j>i} are indices from the first sequence, then there must not be two indices l > k {\displaystyle l>k} in the other sequence, such that index i {\displaystyle i} is matched with index l {\displaystyle l} and index j {\displaystyle j} is matched with index k {\displaystyle k} , and vice versa We can plot each match between the sequences 1 : M {\displaystyle 1:M} and 1 : N {\displaystyle 1:N} as a path in a M × N {\displaystyle M\times N} matrix from ( 1 , 1 ) {\displaystyle (1,1)} to ( M , N ) {\displaystyle (M,N)} , such that each step is one of ( 0 , 1 ) , ( 1 , 0 ) , ( 1 , 1 ) {\displaystyle (0,1),(1,0),(1,1)} . In this formulation, we see that the number of possible matches is the Delannoy number. The optimal match is denoted by the match that satisfies all the restrictions and the rules and that has the minimal cost, where the cost is computed as the sum of absolute differences, for each matched pair of indices, between their values. The sequences are "warped" non-linearly in the time dimension to determine a measure of their similarity independent of certain non-linear variations in the time dimension. This sequence alignment method is often used in time series classification. Although DTW measures a distance-like quantity between two given sequences, it doesn't guarantee the triangle inequality to hold. In addition to a similarity measure between the two sequences (a so called "warping path" is produced), by warping according to this path the two signals may be aligned in time. T
Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «time series»).
Fonte: Wikipedia in inglese, voce «Dynamic time warping» — https://en.wikipedia.org/wiki/Dynamic_time_warping
Wikidata Q1268863: «algoritmo» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1268863
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Dynamic_time_warping?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1329173867, consultata il 2026-10-06T11:11:08.189Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f4d2e718d0f0737a5a8bc2c644172614de74fc114e76c2159633439d95a33357