The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
The BOSS is concerned with time series classification in the presence of noise
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
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
Clustering of time series data—a survey
Warren Liao, T. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.01.025 · Cited by 2,401
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Experiencing SAX: A novel symbolic representation of time series
Lin, J., Keogh, E., Wei, L., & Lonardi, S. (2007) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-007-0064-z · Cited by 1,618
Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · Knowledge and Information Systems · doi:10.1007/pl00011669 · Cited by 1,573
Discovering similar multidimensional trajectories
Vlachos, M., Kollios, G., & Gunopulos, D. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994784 · Cited by 1,468
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
Searching and mining trillions of time series subsequences under dynamic time warping
Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., & Keogh, E. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339576 · Cited by 1,047
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
On the need for time series data mining benchmarks: a survey and empirical demonstration
Keogh, E., & Kasetty, S. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775062 · Cited by 442
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×
“In contrast Shapelets classifiers (Mueen et al. 2011; Ye and Keogh 2011; Rakthanmanon and Keogh 2013) extract representative variable-length subsequences (called shapelets) from a time series for classification.”
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 Complexity-Invariant Distance Measure for Time Series
Batista, G. E. A. P. A., Wang, X., & Keogh, E. J. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.60 · Cited by 329
Rotation-invariant similarity in time series using bag-of-patterns representation
Lin, J., Khade, R., & Li, Y. (2012) · Journal of Intelligent Information Systems · doi:10.1007/s10844-012-0196-5 · Cited by 295
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
SAX-VSM: Interpretable Time Series Classification Using SAX and Vector Space Model
Senin, P., & Malinchik, S. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.52 · Cited by 236
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
SFA: a symbolic fourier approximation and index for similarity search in high dimensional datasets
Schäfer, P., & Högqvist, M. (2012) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/2247596.2247656 · Cited by 195
Self-citationTime-series Bitmaps: a Practical Visualization Tool for Working with Large Time Series Databases
Kumar, N., Lolla, V. N., Keogh, E., Lonardi, S., Ratanamahatana, C. A., & Wei, L. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.55 · Cited by 164
Time Series Classification under More Realistic Assumptions
Hu, B., Chen, Y., & Keogh, E. (2013) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972832.64 · Cited by 151
Transformation Based Ensembles for Time Series Classification
Bagnall, A. J., Davis, L. M., Hills, J., & Lines, J. (2012) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.27 · Cited by 142
Indexable PLA for efficient similarity search
Chen, Q., Chen, L., Lian, X., Liu, Y., & Yu, J. X. (2007) · Cited by 107
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
“Despite the fact that a huge number of parameters risks overfitting (Zhang et al., 2017) the relatively small train set in the UCR/UEA archive, our experiments showed that not only DNNs are able to significantly outperform the NN-DTW, but are also able to achieve results that are not significantly different than COTE…”
BackgroundMethodInfluentialTime series classification from scratch with deep neural networks: A strong baseline
Wang, Z., Yan, W., & Oates, T. (2017) · 2017 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2017.7966039 · Cited by 2,299
Inceptiontime: finding alexnet for time series classification
Ismail Fawaz, H., Lucas, B., Forestier, G., Pelletier, C., Schmidt, D. F., Weber, J., Webb, G. I., Idoumghar, L., Muller, P.-A., & Petitjean, F. (2020) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-020-00710-y · Cited by 1,788
“The most famous one being the Bag-of-SFA-Symbols (BOSS), which is based on an ensemble of NNs classifiers coupled with a bespoke Euclidean distance computed on the frequency histograms obtained from the Symbolic Fourier Approximation (SFA) discretization (Sch¨afer, 2015a).”
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
“During the parameter search of window sizes, the BOSS ensemble retains all classifiers with training accuracy within 92% of the best.”
BackgroundMethodInfluential
Metadata
- Authors
- Schäfer, P.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2014-09-16
- Volume
- 29
- Issue
- 6
- Pages
- 1505-1530
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1968354112
- Cited by
- 560
- References
- 22
- FWCI
- 10.77
- Type
- journal article
- 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.