| digest: | Series Distance Calculation using Dynamic Time Warping | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| species: | data | ||||||||
| sc-categories: | Classification, DTW | ||||||||
| sc-related: | |||||||||
| see-also: | DataSeries | ||||||||
| description: | Calculate the distance between two series using the dynamic time warping algorithm | ||||||||
| discussion: | To keep with the interface of the :fluid-obj:`DTWClassifier`, the DTWClassifier must first be To classify a point, Keep in mind that this is a brute-force measure, so evaluation will become very slow for large numbers of points or long series. |
||||||||
| control numNeighbours: | The number of neighbours to consider | ||||||||
| control constraint: | The constraint to use in the DTW algorithm when calculating the distance between two time series. 'Warping' in this context means how distorted the genral shape of the series is. For example, a pulse with a fast attack and slow decay will register as identical to the case with fast decay and slow attack, since stretching the time series can make it match in shape. If constraints are applied however, the amount of warping is restricted, so that the general shape of the series is kept. See https://rtavenar.github.io/blog/dtw.html#setting-additional-constraints for a beautiful visual explanation of the constraints
|
||||||||
| control constraintParam: | The maximum radius a frame can warp away from its initial location when using a sakoe-chiba constraint, and parameter for the ikatura constraint when using that. A higher value results in being able to warp more. See https://rtavenar.github.io/blog/dtw.html#setting-additional-constraints for an explanation of the significance. |
||||||||
| message cost: |
Return the cost, i.e. distance, between the series |
||||||||
| message bufCost: |
Return the cost, i.e. distance, between the buffers |