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.2.1
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.2.1.tar.gz | 2.3 kB | Details |
Release files / fastdtw-0.2.1.tar.gz
| Download URL | fastdtw-0.2.1.tar.gz |
|---|---|
| Size | 2.3 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
c7aaf0e0d0f89ffff271f5c7e65439727313622cbab78b932756fef1a2004d16
|
|
BLAKE2b-256 checksum How to use checksums |
27cbc65ebd528868ec39c47699d7fd65a0409a396085872af63468df45e972e8
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
