The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Dynamic Time Warping Averaging of Time Series Allows Faster and More Accurate Classification
Abstract
Recent years have seen significant progress in improving both the efficiency and effectiveness of time series classification. However, because the best solution is typically the Nearest Neighbor algorithm with the relatively expensive Dynamic Time Warping as the distance measure, successful deployments on resource constrained devices remain elusive. Moreover, the recent explosion of interest in wearable devices, which typically have limited computational resources, has created a growing need for very efficient classification algorithms. A commonly used technique to glean the benefits of the Nearest Neighbor algorithm, without inheriting its undesirable time complexity, is to use the Nearest Centroid algorithm. However, because of the unique properties of (most) time series data, the centroid typically does not resemble any of the instances, an unintuitive and underappreciated fact. In this work we show that we can exploit a recent result to allow meaningful averaging of 'warped' times series, and that this result allows us to create ultra-efficient Nearest 'Centroid' classifiers that are at least as accurate as their more lethargic Nearest Neighbor cousins.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
GALTON, F. (1907) · Nature · doi:10.1038/075450a0 · Cited by 1,080
Cited by
Transfer learning for time series classification
Ismail Fawaz, H., Forestier, G., Weber, J., Idoumghar, L., & Muller, P.-A. (2018) · 2018 IEEE International Conference on Big Data (Big Data) · doi:10.1109/bigdata.2018.8621990 · Cited by 319
Self-citationGorilla: a fast, scalable, in-memory time series database
Pelkonen, T., Franklin, S., Teller, J., Cavallaro, P., Huang, Q., Meza, J., & Veeraraghavan, K. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2824032.2824078 · Cited by 290
shapeDTW: Shape Dynamic Time Warping
Zhao, J., & Itti, L. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.09.020 · Cited by 281
Lee, S. I., Adans-Dester, C. P., Grimaldi, M., Dowling, A. V., Horak, P. C., Black-Schaffer, R. M., Bonato, P., & Gwin, J. T. (2018) · IEEE Journal of Translational Engineering in Health and Medicine · doi:10.1109/jtehm.2018.2829208 · Cited by 119
Physical human locomotion prediction using manifold regularization
Javeed, M., Shorfuzzaman, M., Alsufyani, N., Chelloug, S. A., Jalal, A., & Park, J. (2022) · PeerJ Computer Science · doi:10.7717/peerj-cs.1105 · Cited by 18
Metadata
- Authors
- Petitjean, F., Forestier, G., Webb, G. I., Nicholson, A. E., Chen, Y., & Keogh, E.
- Venue
- 2014 IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2014-12
- Pages
- 470-479
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W1989417520
- Cited by
- 239
- References
- 1
- FWCI
- 16.50
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Dynamic Time Warping Averaging of Time Series Allows Faster and More Accurate Classification. https://app.cochat.ai/papers/10.1109/icdm.2014.27
- The paper
- Petitjean, F., Forestier, G., Webb, G. I., Nicholson, A. E., Chen, Y., & Keogh, E. (2014). Dynamic Time Warping Averaging of Time Series Allows Faster and More Accurate Classification. 2014 IEEE International Conference on Data Mining. https://doi.org/10.1109/icdm.2014.27
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.