Differences

This shows you the differences between two versions of the page.

--- sift:dynamic_time_warping:dynamic_time_warping [2024/06/19 12:46] – sgranger
+++ sift:dynamic_time_warping:dynamic_time_warping [2024/11/15 20:13] (current) – [Dynamic Time Warping] wikisysop
@@ 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. to review supporting literature, see [[[https://ieeexplore.ieee.org/document/7023364%7chere|[1]]]].
+====== Dynamic Time Warping ======
-dtwalign.png
+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 larger 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. To review supporting literature, see [[https://ieeexplore.ieee.org/document/7023364|[1]]].
-===== contents =====
+{{:DTWAlign.png}}
+==== Mathematics of Dynamic Time Warping ====
+Say you had a trace x of size N, and a trace y of size M, this is how you would calculate the cost matrix:
-  * [[#mathematics_of_dynamic_time_warping|1 mathematics of dynamic time warping]]
+{{:DTWeq.png}}
-  * [[#computing_dynamic_time_warping_in_sift|2 computing dynamic time warping in sift]]
-    * [[#exporting_results|2.1 exporting results]]
-  * [[#references|3 references]]
-===== mathematics of dynamic time warping =====
-say you had a trace x of size n, and a trace y of size m, this is how you would calculate the cost matrix:
-dtweq.png
 where d() is equal to the absolute distance.
-to speed up the computational cost a lower bound keogh algorithm was implemented.
+To speed up the computational cost a Lower Bound Keogh algorithm was implemented.
-===== computing dynamic time warping in sift =====
+==== Computing Dynamic Time Warping in Sift ====
-in sift you can use dynamic time warping two different ways for your analyses.
+In Sift you can use Dynamic Time Warping two different ways for your analyses.
-the first way to use dynamic time warping is by finding anomalies within your dataset. within a data set, each trace will be compared to every other trace. traces with a median distance that is a specified standard deviation away from the average will be identified as an anomaly. this function is useful when trying to identify particular moments that may be interesting to look at or by quickly cleaning your dataset from outliers.
+The first way to use Dynamic Time warping is by finding anomalies within your dataset. Within a data set, each trace will be compared to every other trace. Traces with a median distance that is a specified standard deviation away from the average will be identified as an anomaly. This function is useful when trying to identify particular moments that may be interesting to look at or by quickly cleaning your dataset from outliers.
-in this example we have used dynamic time warping to find anomalies within all workspaces of ankleanglex. the results have given us a list of the traces identified as anomalies and their corresponding cost function. if we have the group plotted, these traces will also be selected. after a quick visual check we can press the **exclude anomalies** button and they will be exclude from the group.
+In this example we have used Dynamic Time Warping to find anomalies within all workspaces of AnkleAngleX. The results have given us a list of the traces identified as anomalies and their corresponding cost function. If we have the group plotted, these traces will also be selected. After a quick visual check we can press the **Exclude Anomalies** button and they will be exclude from the group.
-dtwanomalies.png
+{{:DTWAnomalies.png}}
 \\
-the second way to use dynamic time warping is by comparing a specific trace. this can be done if you want to find what trace is most similar to another.
+The second way to use Dynamic Time Warping is by comparing a specific trace. This can be done if you want to find what trace is most similar to another.
+In this example we found that the trace - AnkleAngleX/Sub02Workspace/TM_LKrunT2_2.c3d/LAnkleAngle/frames_439,546 is most similar to AnkleAngleX/Sub01Workspace/OG_LA_run02.c3d/frames_454,578.
-in this example we found that the trace - ankleanglex/sub02workspace/tm_lkrunt2_2.c3d/lankleangle/frames_439,546 is most similar to ankleanglex/sub01workspace/og_la_run02.c3d/frames_454,578.
+{{:DTWTrace.png}}
-dtwtrace.png
+=== Exporting Results ===
-==== exporting results ====
+Results for each dynamic time warping test can be exported in the {{:sift_export_results.png}} [[Sift:Export:Export_Results_Dialog|Export Results Dialog]].
-results for each dynamic time warping test can be exported in the sift_export_results.png [[sift:export:export_results_dialog|export results dialog]].
+==== References ====
-===== references =====
+[1] F. Petitjean, G. Forestier, G. I. Webb, A. E. Nicholson, Y. Chen and E. Keogh, "Dynamic Time Warping Averaging of Time Series Allows Faster and More Accurate Classification," 2014 IEEE International Conference on Data Mining, Shenzhen, China, 2014, pp. 470-479, doi: 10.1109/ICDM.2014.27.
-[1] f. petitjean, g. forestier, g. i. webb, a. e. nicholson, y. chen and e. keogh, "dynamic time warping averaging of time series allows faster and more accurate classification," 2014 ieee international conference on data mining, shenzhen, china, 2014, pp. 470-479, doi: 10.1109/icdm.2014.27.
-}}}}}}}}}}