sDTW
Authors:
Open Access
- 1 July 2012
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 5 (11) , 1519-1530
Abstract
Many applications generate and consume temporal data and retrieval of time series is a key processing step in many application domains. Dynamic time warping (DTW) distance between time series of size N and M is computed relying on a dynamic programming approach which creates and fills an N x M grid to search for an optimal warp path . Since this can be costly, various heuristics have been proposed to cut away the potentially unproductive portions of the DTW grid. In this paper, we argue that time series often carry structural features that can be used for identifying locally relevant constraints to eliminate redundant work. Relying on this observation, we propose salient feature based sDTW algorithms which first identify robust salient features in the given time series and then find a consistent alignment of these to establish the boundaries for the warp path search. More specifically, we propose alternative fixed core&adaptive width, adaptive core&fixed width , and adaptive core&adaptive width strategies which enforce different constraints reflecting the high level structural characteristics of the series in the data set. Experiment results show that the proposed sDTW algorithms help achieve much higher accuracy in DTW computation and time series retrieval than fixed core & fixed width algorithms that do not leverage local features of the given time series.Keywords
This publication has 12 references indexed in Scilit:
- Searching and mining trillions of time series subsequences under dynamic time warping2012
- Querying and mining of time series dataProceedings of the VLDB Endowment, 2008
- A performance evaluation of local descriptorsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Distinctive Image Features from Scale-Invariant KeypointsInternational Journal of Computer Vision, 2004
- Making Time-series Classification More Accurate Using Learned Constraints2004
- Iterative Deepening Dynamic Time Warping for Time Series2002
- Scaling up dynamic time warping for datamining applications2000
- Dynamic programming algorithm optimization for spoken word recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- Minimum prediction residual principle applied to speech recognitionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950