Journal ArticleDOI
Toward accurate dynamic time warping in linear time and space
Stan Salvador,Philip K. Chan +1 more
- Vol. 11, Iss: 5, pp 561-580
TLDR
This paper introduces FastDTW, an approximation of DTW that has a linear time and space complexity and shows a large improvement in accuracy over existing methods.Abstract:
Dynamic Time Warping (DTW) has a quadratic time and space complexity that limits its use to small time series. In this paper we introduce FastDTW, an approximation of DTW that has a linear time and space complexity. FastDTW uses a multilevel approach that recursively projects a solution from a coarser resolution and refines the projected solution. We prove the linear time and space complexity of FastDTW both theoretically and empirically. We also analyze the accuracy of FastDTW by comparing it to two other types of existing approximate DTW algorithms: constraints (such as Sakoe-Chiba Bands) and abstraction. Our results show a large improvement in accuracy over existing methods.read more
Citations
More filters
Journal ArticleDOI
A review on time series data mining
TL;DR: The primary objective of this paper is to serve as a glossary for interested researchers to have an overall picture on the current time series data mining development and identify their potential research direction to further investigation.
Journal ArticleDOI
Time-series clustering - A decade review
TL;DR: This review will expose four main components of time-series clustering and is aimed to represent an updated investigation on the trend of improvements in efficiency, quality and complexity of clustering time- series approaches during the last decade and enlighten new paths for future works.
Journal ArticleDOI
Computing and Visualizing Dynamic Time Warping Alignments in R: The dtw Package
TL;DR: The dtw package allows R users to compute time series alignments mixing freely a variety of continuity constraints, restriction windows, endpoints, local distance definitions, and so on.
Proceedings ArticleDOI
Gestures without libraries, toolkits or training: a $1 recognizer for user interface prototypes
TL;DR: This work presents a "$1 recognizer" that is easy, cheap, and usable almost anywhere in about 100 lines of code, and discusses the effect that the number of templates or training examples has on recognition, the score falloff along recognizers' N-best lists, and results for individual gestures.
Journal ArticleDOI
Time-series data mining
Philippe Esling,Carlos Agon +1 more
TL;DR: A survey of the techniques applied for time-series data mining, namely representation techniques, distance measures, and indexing methods, is provided.
References
More filters
Journal ArticleDOI
Dynamic programming algorithm optimization for spoken word recognition
TL;DR: This paper reports on an optimum dynamic progxamming (DP) based time-normalization algorithm for spoken word recognition, in which the warping function slope is restricted so as to improve discrimination between words in different categories.
Journal ArticleDOI
Exact indexing of dynamic time warping
TL;DR: This work introduces a novel technique for the exact indexing of Dynamic time warping and proves its vast superiority over all competing approaches in the largest and most comprehensive set of time series indexing experiments ever undertaken.
Journal ArticleDOI
Minimum prediction residual principle applied to speech recognition
TL;DR: A computer system is described in which isolated words, spoken by a designated talker, are recognized through calculation of a minimum prediction residual through optimally registering the reference LPC onto the input autocorrelation coefficients using the dynamic programming algorithm.
Journal ArticleDOI
On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration
Eamonn Keogh,Shruti Kasetty +1 more
TL;DR: The most exhaustive set of time series experiments ever attempted, re-implementing the contribution of more than two dozen papers, and testing them on 50 real world, highly diverse datasets support the claim that there is a need for a set oftime series benchmarks and more careful empirical evaluation in the data mining community.
Proceedings ArticleDOI
Multilevel hypergraph partitioning: application in VLSI domain
TL;DR: The experiments show that the multilevel hypergraph partitioning algorithm produces high quality partitioning in relatively small amount of time and outperforms other schemes (in hyperedge cut) quite consistently with larger margins.