Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Dynamisk tidssvepning× | Levenshtein-avstånd× | |
|---|---|---|
| Ämnesområde | Beslutsfattande | Beslutsfattande |
| Familj | MCDM | MCDM |
| Ursprungsår≠ | 1978 | 1966 |
| Upphovsperson≠ | Hideki Sakoe and Seibi Chiba | Vladimir Levenshtein |
| Typ≠ | Elastic sequence alignment metric | Edit distance metric |
| Ursprungskälla≠ | Sakoe, H., & Chiba, S. (1978). Dynamic programming algorithm optimization for spoken word recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, 26(1), 43-49. DOI ↗ | Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10, 707-710. link ↗ |
| Alias≠ | DTW, dynamic programming time warping, elastic distance | edit distance, Damerau-Levenshtein distance |
| Närliggande | 1 | 1 |
| Sammanfattning≠ | Dynamic Time Warping is a distance metric for comparing time series or sequential data that may vary in length or speed. Introduced by Hideki Sakoe and Seibi Chiba in 1978 for speech recognition, DTW measures the minimal cumulative distance needed to align two sequences using dynamic programming. Unlike fixed-distance metrics, DTW allows flexible time warping, making it ideal for sequences that are similar in shape but offset or scaled differently in time. | Levenshtein distance, also called edit distance, measures the minimum number of single-character edits (insertions, deletions, substitutions) needed to transform one string into another. Introduced by Vladimir Levenshtein in 1966, this metric is a true metric (satisfying all distance properties) and is fundamental in computational linguistics, spell checking, DNA sequence comparison, and record linkage. It ranges from 0 (identical strings) to the length of the longer string. |
| ScholarGateDatamängd ↗ |
|
|