dtw: Dynamic time warping algorithms A comprehensive implementation of dynamic time warping (DTW) algorithms in R. DTW computes the optimal (least cumulative distance) alignment between points of two time series. Common DTW variants covered include local (slope) and global (window) constraints, subsequence matches, arbitrary distance definitions, normalizations, minimum variance matching, and so on. Provides cumulative distances, alignments, specialized plot styles, etc.
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Zhao, Yanchang: R and data mining. Examples and case studies (2013)
- Slaets, Leen; Claeskens, Gerda; Hubert, Mia: Phase and amplitude-based clustering for functional data (2012)
- de Gregorio, Alessandro; Iacus, Stefano Maria: Clustering of discretely observed diffusion processes (2010)