The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Learning time-series shapelets
Abstract
Shapelets are discriminative sub-sequences of time series that best predict the target variable. For this reason, shapelet discovery has recently attracted considerable interest within the time-series research community. Currently shapelets are found by evaluating the prediction qualities of numerous candidates extracted from the series segments. In contrast to the state-of-the-art, this paper proposes a novel perspective in terms of learning shapelets. A new mathematical formalization of the task via a classification objective function is proposed and a tailored stochastic gradient learning algorithm is applied. The proposed method enables learning near-to-optimal shapelets directly without the need to try out lots of candidates. Furthermore, our method can learn true top-K shapelets by capturing their interaction. Extensive experimentation demonstrates statistically significant improvement in terms of wins and ranks against 13 baselines over 28 time-series datasets.
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
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
Statistical Comparisons of Classifiers over Multiple Data Sets
DemšarJanez (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248548 · Cited by 1,074
Time 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
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
Time series shapelets: a novel technique that allows accurate, interpretable and fast classification
Ye, L., & Keogh, E. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0179-5 · Cited by 406 · cited 1×
“4 Distances Between Shapelets and Series The distance between the i-th series Ti and the k-th shapelet Sk is defined as the minimum distance Mi,k (shown in Equation 1) among the distances between the shapelet Sk and each segment j of Ti [17, 18].”
BackgroundFast Shapelets: A Scalable Algorithm for Discovering Time Series Shapelets
Rakthanmanon, T., & Keogh, E. (2013) · Proceedings of the 2013 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.74 · Cited by 388
A shapelet transform for time series classification
Lines, J., Davis, L. M., Hills, J., & Bagnall, A. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339579 · Cited by 368
Logical-shapelets: an expressive primitive for time series classification
Mueen, A., Keogh, E., & Young, N. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020587 · Cited by 282
Clustering Time Series Using Unsupervised-Shapelets
Zakaria, J., Mueen, A., & Keogh, E. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.26 · Cited by 231
Algorithms for subset selection in linear regression
Das, A., & Kempe, D. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374384 · Cited by 196
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
Early classification on time series
Xing, Z., Pei, J., & Yu, P. S. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-011-0400-x · Cited by 129
Gesture recognition with inertial sensors and optimized DTW prototypes
Hartmann, B., & Link, N. (2010) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2010.5641703 · Cited by 86
Efficient Pattern-Based Time Series Classification on GPU
Chang, K.-W., Deka, B., Hwu, W., & Roth, D. (2012) · Proceedings · doi:10.1109/icdm.2012.132 · Cited by 69
Fast Time Series Classification Based on Infrequent Shapelets
He, Q., Zhidong, Zhuang, F., Shang, T., & Shi, Z. (2012) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2012.44 · Cited by 43
Alternative Quality Measures for Time Series Shapelets
Lines, J., & Bagnall, A. J. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32639-4_58 · Cited by 36
Human Gait Recognition and Classification Using Time Series Shapelets
Shajina, T., & Sivakumar, P. B. (2012) · International Conference on Advances in Computing and Communications (ICACC) · doi:10.1109/icacc.2012.8 · Cited by 24
Cited by
Deep learning for time series classification: a review
Ismail Fawaz, H., Forestier, G., Weber, J., Idoumghar, L., & Muller, P.-A. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-019-00619-1 · Cited by 3,342
“This observation would also be backed up by the mathematical proof provided by Cui et al. (2016), that showed how the learned filters in a CNN can be considered a generic form of shapelets extracted by the learning shapelets algorithm (Grabocka et al., 2014).”
BackgroundMethodLSTM Fully Convolutional Networks for Time Series Classification
Karim, F., Majumdar, S., Darabi, H., & Chen, S. (2018) · IEEE Access · doi:10.1109/access.2017.2779939 · Cited by 1,465
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
“Grabocka et al. (2014) describe a shapelet discovery algorithm that adopts a heuristic gradient descent shapelet search procedure rather than enumeration.”
MethodMulti-Scale Convolutional Neural Networks for Time Series Classification
Cui, Z., Chen, W., & Chen, Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.06995 · Cited by 455
Time-Series Classification with COTE: The Collective of Transformation-Based Ensembles
Bagnall, A., Lines, J., Hills, J., & Bostrom, A. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2416723 · Cited by 416
Metadata
- Authors
- Grabocka, J., Schilling, N., Wistuba, M., & Schmidt-Thieme, L.
- Venue
- Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2014-08-24
- Pages
- 392-401
- OpenAlex
- W1978371851
- Cited by
- 472
- References
- 17
- FWCI
- 16.78
- 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
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.