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
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
fastdtw-0.2.2.tar.gz
(2.3 kB
view details)
File details
Details for the file fastdtw-0.2.2.tar.gz.
File metadata
- Download URL: fastdtw-0.2.2.tar.gz
- Upload date:
- Size: 2.3 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
b3b6d7c10605c9beadd6399e7a3902597d398dbbb378cf06c51a964bcf725307
|
|
| MD5 |
7c4738728179032e438f4283f3c1ff13
|
|
| BLAKE2b-256 |
f2f59b5f97a540247aab9c29335c559fc34c292ceba60352d413dfd5201f08b3
|
