sift:dynamic_time_warping:dynamic_time_warping_dialog
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| sift:dynamic_time_warping:dynamic_time_warping_dialog [2024/07/17 15:10] – sgranger | sift:dynamic_time_warping:dynamic_time_warping_dialog [2024/07/17 15:44] (current) – created sgranger | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== | + | ====== |
| Dynamic Time Warping is a distance based algorithm that allows you to compare and measure similarity between two time based sequences, by minimizing the Euclidean distance between points. Essentially it aligns each point of one trace to a corresponding point on the other trace that require the least distance. All distances are added together to make the total cost function of the trace. The large the cost function, the less similar the two traces are. This can be useful when trying to identify a singular trace or to find outliers. A more detailed overview of Dynamic Time Warping in Sift can be found [[Sift: | Dynamic Time Warping is a distance based algorithm that allows you to compare and measure similarity between two time based sequences, by minimizing the Euclidean distance between points. Essentially it aligns each point of one trace to a corresponding point on the other trace that require the least distance. All distances are added together to make the total cost function of the trace. The large the cost function, the less similar the two traces are. This can be useful when trying to identify a singular trace or to find outliers. A more detailed overview of Dynamic Time Warping in Sift can be found [[Sift: | ||
sift/dynamic_time_warping/dynamic_time_warping_dialog.1721229009.txt.gz · Last modified: 2024/07/17 15:10 by sgranger