The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Faster retrieval with a two-pass dynamic-time-warping lower bound
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
Cited by
Experimental comparison of representation methods and distance measures for time series data
Wang, X., Mueen, A., Ding, H., Trajcevski, G., Scheuermann, P., & Keogh, E. (2013) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0250-5 · Cited by 845
Weighted dynamic time warping for time series classification
Jeong, Y.-S., Jeong, M. K., & Omitaomu, O. A. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.022 · Cited by 695
Ghimire, D., & Lee, J. (2013) · Sensors · doi:10.3390/s130607714 · Cited by 291
shapeDTW: Shape Dynamic Time Warping
Zhao, J., & Itti, L. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.09.020 · Cited by 281
Univariate time series classification using information geometry
Sun, J., Yang, Y., Liu, Y., Chen, C., Rao, W., & Bai, Y. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.05.040 · Cited by 31
Metadata
- Authors
- Lemire, D.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2009-09
- Volume
- 42
- Issue
- 9
- Pages
- 2169-2180
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W1974339580
- Cited by
- 184
- References
- 1
- FWCI
- 7.35
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Faster retrieval with a two-pass dynamic-time-warping lower bound. https://app.cochat.ai/papers/10.1016/j.patcog.2008.11.030
- The paper
- Lemire, D. (2009). Faster retrieval with a two-pass dynamic-time-warping lower bound. Pattern Recognition. https://doi.org/10.1016/j.patcog.2008.11.030
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.