fastdtw
Python implementation of FastDTW [1], which is an approximate Dynamic Time Warping (DTW) algorithm that provides optimal or near-optimal alignments with an O(N) time and memory complexity.
Install
pip install fastdtw
Example
import numpy as np from scipy.spatial.distance import euclidean from fastdtw import fastdtw x = np.array([[1,1], [2,2], [3,3], [4,4], [5,5]]) y = np.array([[2,2], [3,3], [4,4]]) distance, path = fastdtw(x, y, dist=euclidean) print(distance)
References
1 maintainer
Metadata
1 maintainer
Release files for fastdtw 0.3.0
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| fastdtw-0.3.0.tar.gz | 6.2 kB | Details |
Release files / fastdtw-0.3.0.tar.gz
| Download URL | fastdtw-0.3.0.tar.gz |
|---|---|
| Size | 6.2 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
333748313dedf95844f1acee1a7b5c9347c692e11d09ac85c206b1b1453639fc
|
|
BLAKE2b-256 checksum How to use checksums |
b1e8fc9536a1ae627389660245dbc56f584b347d99a31224e4f8be5b791abc30
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
