Need help with fastdtw?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

slaypni
551 Stars 103 Forks MIT License 32 Commits 28 Opened issues

Description

A Python implementation of FastDTW

Services available

!
?

Need anything else?

Contributors list

# 194,404
C
TypeScr...
nextjs
24 commits
# 344,779
C++
C
Shell
portfol...
3 commits
# 22,727
Git
R
ml
knn-sea...
1 commit
# 52,430
Python
sed
cpython
cython
1 commit
# 345,273
Python
1 commit

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] Stan Salvador, and Philip Chan. "FastDTW: Toward accurate dynamic time warping in linear time and space." Intelligent Data Analysis 11.5 (2007): 561-580.

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.