The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Logical-shapelets: an expressive primitive for time series classification
Abstract
Time series shapelets are small, local patterns in a time series that are highly predictive of a class and are thus very useful features for building classifiers and for certain visualization and summarization tasks. While shapelets were introduced only recently, they have already seen significant adoption and extension in the community. Despite their immense potential as a data mining primitive, there are two important limitations of shapelets. First, their expressiveness is limited to simple binary presence/absence questions. Second, even though shapelets are computed offline, the time taken to compute them is significant. In this work, we address the latter problem by introducing a novel algorithm that finds shapelets in less time than current methods by an order of magnitude. Our algorithm is based on intelligent caching and reuse of computations, and the admissible pruning of the search space. Because our algorithm is so fast, it creates an opportunity to consider more expressive shapelet queries. In particular, we show for the first time an augmented shapelet representation that distinguishes the data based on conjunctions or disjunctions of shapelets. We call our novel representation Logical-Shapelets. We demonstrate the efficiency of our approach on the classic benchmark datasets used for these problems, and show several case studies where logical shapelets significantly outperform the original shapelet representation and other time series classification techniques. We demonstrate the utility of our ideas in domains as diverse as gesture recognition, robotics, and biometrics.
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
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., & Keogh, E. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454226 · Cited by 1,354
Self-citationTime series shapelets: a new primitive for data mining
Ye, L., & Keogh, E. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557122 · Cited by 987
Self-citationOn the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration
Keogh, E., & Kasetty, S. (2003) · Data Mining and Knowledge Discovery · doi:10.1023/a:1024988512476 · Cited by 861
Self-citationExact indexing of dynamic time warping
Keogh, E. (2002) · Cited by 594
Self-citationuWave: Accelerometer-based personalized gesture recognition and its applications
Liu, J., Wang, Z., Zhong, L., Wickramasuriya, J., & Vasudevan, V. (2009) · 2009 IEEE International Conference on Pervasive Computing and Communications · doi:10.1109/percom.2009.4912759 · Cited by 559
uWave: Accelerometer-based personalized gesture recognition and its applications
Liu, J., Zhong, L., Wickramasuriya, J., & Vasudevan, V. (2009) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2009.07.007 · Cited by 479
Extracting Interpretable Features for Early Classification on Time Series
Xing, Z., Pei, J., Yu, P. S., & Wang, K. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.22 · Cited by 177
BRAID: stream mining through group lag correlations
Sakurai, Y., Papadimitriou, S., & Faloutsos, C. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066226 · Cited by 166
McGovern, A., Rosendahl, D. H., Brown, R. A., & Droegemeier, K. K. (2010) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0193-7 · Cited by 109
Cited by
Bagnall, A., Lines, J., Bostrom, A., Large, J., & Keogh, E. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0483-9 · Cited by 1,377
Self-citationk-Shape: Efficient and Accurate Clustering of Time Series
Paparrizos, J., & Gravano, L. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2737793 · Cited by 680
The BOSS is concerned with time series classification in the presence of noise
Schäfer, P. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0377-7 · Cited by 560
Classification of time series by shapelet transformation
Hills, J., Lines, J., Baranauskas, E., Mapp, J., & Bagnall, A. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-013-0322-1 · Cited by 538
Learning time-series shapelets
Grabocka, J., Schilling, N., Wistuba, M., & Schmidt-Thieme, L. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623613 · Cited by 472
Metadata
- Authors
- Mueen, A., Keogh, E., & Young, N.
- Venue
- Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2011-08-21
- Pages
- 1154-1162
- OpenAlex
- W2011208599
- Cited by
- 282
- References
- 14
- FWCI
- 14.94
- 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: Logical-shapelets: an expressive primitive for time series classification. https://app.cochat.ai/papers/10.1145/2020408.2020587
- The paper
- Mueen, A., Keogh, E., & Young, N. (2011). Logical-shapelets: an expressive primitive for time series classification. Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/2020408.2020587
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.