Cited by 406Time Series Analysis and ForecastingImage Retrieval and Classification TechniquesData Mining Algorithms and Applications

Time series shapelets: a novel technique that allows accurate, interpretable and fast classification

Open access
Ye, Lexiang, Keogh, Eamonn·2011·Data Mining and Knowledge Discovery

Abstract

Classification of time series has been attracting great interest over the past decade. While dozens of techniques have been introduced, recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm is very difficult to beat for most time series problems, especially for large-scale datasets. While this may be considered good news, given the simplicity of implementing the nearest neighbor algorithm, there are some negative consequences of this. First, the nearest neighbor algorithm requires storing and searching the entire dataset, resulting in a high time and space complexity that limits its applicability, especially on resource-limited sensors. Second, beyond mere classification accuracy, we often wish to gain some insight into the data and to make the classification result more explainable, which global characteristics of the nearest neighbor cannot provide. In this work we introduce a new time series primitive, time series shapelets, which addresses these limitations. Informally, shapelets are time series subsequences which are in some sense maximally representative of a class. We can use the distance to the shapelet, rather than the distance to the nearest neighbor to classify objects. As we shall show with extensive empirical evaluations in diverse domains, classification algorithms based on the time series shapelet primitives can be interpretable, more accurate, and significantly faster than state-of-the-art classifiers.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10618-010-0179-5

Cites

27 of 27 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Multiple-instance configurations lead to poor scalability, high intractability, and low interpretability and explainability.

    “poor scalability, high intractability, and low interpretability and explainability [24,25].”

    From TVGeAN: Tensor Visibility Graph-Enhanced Attention Network for Versatile Multivariant Time Series Learning Tasks (2024) · cites this paper as [25]

    Section 2.1.1 says instance-based methods are generally less interpretable than rule-based methods and that a global-view time-series method loses efficiency on large-scale datasets. It also describes a particular pattern-search problem as intractable. These passages support aspects of the claimed drawbacks, but they do not establish that multiple-instance configurations generally have all three. (LLM, conf=0.78)

    Experimental — accuracy not yet measured
  • Ye and Keogh (2011) identified that the most important shapelet for the Gun/NoGun classification occurs when the actor's arm is lowered.

    “Ye and Keogh (2011) identified that the most important shapelet for the Gun/NoGun classification occurs when the actor's arm is lowered (about 120 on the horizontal axis in Figure 13).”

    From Deep learning for time series classification: a review (2019) · cites this paper as Ye and Keogh (2011)

  • Hills et al. (2014) introduced a shapelet transformation based approach that discovered shapelets similar to the ones identified by Ye and Keogh (2011).

    “Hills et al. (2014) introduced a shapelet transformation based approach that discovered shapelets that are similar to the ones identified by Ye and Keogh (2011).”

    From Deep learning for time series classification: a review (2019) · cites this paper as Ye and Keogh (2011)

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

1 of the 28 references couldn’t be matched to a known paper.

Research works printed but not linked: 1

  1. Koschorreck W, Werner W (eds) (1981) Facsimile edition with commentary: Kommentar zum faksimile des codex manesse: Die grosse Heidelberger Liederhandschrift

Cited by

Sorted by citations

Authors
Ye, L., & Keogh, E.
Affiliations
University of California, Riverside (US)
Corresponding author
Ye, Lexiang
Venue
Data Mining and Knowledge Discovery
Published
2010-06-18
Volume
22
Issue
1-2
Pages
149-182
ISSN
  • 1384-5810 (ISSN-L)
  • 1573-756X
OpenAlex
W2030863907
Cited by
406
References
28
Citations by year
2026: 22 · 2025: 29 · 2024: 42 · 2023: 47 · 2022: 43 · 2021: 43 · 2020: 32 · 2019: 28 · 2018: 31 · 2017: 18 · 2016: 19 · 2015: 15 · 2014: 18 · 2013: 12 · 2012: 6
FWCI
9.19
Type
journal article
Language
en
Open access
Licence
cc-by-nc
Locations
Data Mining and Knowledge Discovery (publishedVersion, cc-by-nc)
Funders
National Science Foundation (0803410, 0808770)
Topics
  • Physical Sciences › Computer Science › Signal Processing › Time Series Analysis and Forecasting
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image Retrieval and Classification Techniques
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
Keywords
time series classification, interpretable classification, nearest neighbor classification, large-scale datasets, resource-constrained sensors, classification speed

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