Dynamic Time Warping (DTW) Explained
Автор: StackWild
Загружено: 2022-05-06
Просмотров: 5416
Discord: / discord
A short explanation of the Dynamic Time Warping algorithm using dynamic programming principles.
I drew an extraneous line or two early in the video when demonstrating alignment, to be clear an optimal match between sequences has the following properties: (see https://en.wikipedia.org/wiki/Dynamic...)
1. Every index from the first sequence must be matched with one or more indices from the other sequence, and vice versa
2. 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)
3. 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)
4. The mapping of the indices from the first sequence to indices from the other sequence must be monotonically increasing
Full playlist of dynamic programming series:
• How to Solve Dynamic Programming Problems
List of dynamic programming coding problems:
https://www.practiceproblems.org/cour...
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
