Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound
Pattern Recognition (2008)
- DOI: 10.1016/j.patcog.2008.11.030
- arXiv: 0811.3301
Available from arxiv.org
or
Abstract
The Dynamic Time Warping (DTW) is a popular similarity measure between time series. The DTW fails to satisfy the triangle inequality and its computation requires quadratic time. Hence, to find closest neighbors quickly, we use bounding techniques. We can avoid most DTW computations with an inexpensive lower bound (LB Keogh). We compare LB Keogh with a tighter lower bound (LB Improved). We find that LB Improved-based search is faster. As an example, our approach is 2-3 times faster over random-walk and shape time series.
Author-supplied keywords
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
21 Readers on Mendeley
by Discipline
5% Engineering
by Academic Status
24% Student (Master)
19% Ph.D. Student
14% Researcher (at a non-Academic Institution)
by Country
24% United States
14% Spain
10% Turkey
Groups
 |