Fundamentals of speech recognition
Fundamentals of speech recognition
ACM Computing Surveys (CSUR)
Efficient Retrieval of Similar Time Sequences Under Time Warping
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases
Proceedings of the 17th International Conference on Data Engineering
Exact indexing of dynamic time warping
Knowledge and Information Systems
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Exact indexing of dynamic time warping
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
iSAX: disk-aware mining and indexing of massive time series datasets
Data Mining and Knowledge Discovery
Anticipatory DTW for efficient similarity search in time series databases
Proceedings of the VLDB Endowment
iSAX 2.0: Indexing and Mining One Billion Time Series
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Ptolemaic indexing of the signature quadratic form distance
Proceedings of the Fourth International Conference on SImilarity Search and APplications
On fast non-metric similarity search by metric access methods
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
| Hi-index | 0.00 |
The dynamic time warping (DTW) distance has been used as a popular measure to compare similarities of numeric time series because it provides robust matching that recognizes warps in time, different sampling rate, etc. Although DTW computation can be optimized by dynamic programming, it is still expensive, so there have been many attempts proposed to speedup DTW-based similarity search by distance lowerbounding. Some approaches assume a constrained variant of DTW (i.e., fixed dimensions, warping window constraint, ground distance), while others do not. In this paper, we comprehensively revisit the problem of DTW lowerbounding, define a general form of DTW that fits all the existing variants and goes even beyond. For the constrained variants of general DTW we propose a lowerbound construction generalizing the LB_Keogh that for particular ground distances offers speedup by up to two orders of magnitude. Furthermore, we apply metric and ptolemaic lowerbounding on unconstrained variants of general DTW that beats the few existing competitors up to two orders of magnitude.