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.2
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.2.tar.gz | 118.4 kB | Details |
Release files / fastdtw-0.3.2.tar.gz
| Download URL | fastdtw-0.3.2.tar.gz |
|---|---|
| Size | 118.4 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
09a24d62a8eb72f87c03692dffae4b8d8499b53f503e9abce5e717c5b705dff9
|
|
BLAKE2b-256 checksum How to use checksums |
faefa4cf2d72518b5fccd30284ba4d431fdb6266f72e75702ff05fd7c00b0b63
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
