The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
MiniRocket: A Very Fast (Almost) Deterministic Transform for Time Series Classification
Open accessAbstract
Rocket achieves state-of-the-art accuracy for time series classification with a fraction of the computational expense of most existing methods by transforming input time series using random convolutional kernels, and using the transformed features to train a linear classifier. We reformulate Rocket into a new method, MiniRocket. MiniRocket is up to 75 times faster than Rocket on larger datasets, and almost deterministic (and optionally, fully deterministic), while maintaining essentially the same accuracy. Using this method, it is possible to train and test a classifier on all of 109 datasets from the UCR archive to state-of-the-art accuracy in under 10 minutes. MiniRocket is significantly faster than any other method of comparable accuracy (including Rocket), and significantly more accurate than any other method of remotely similar computational expense.
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
Scikit-learn: Machine Learning in Python
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2078195 · Cited by 8,539
Multi-scale context aggregation by dilated convolutions
Yu, F., & Koltun, V. (2015) · arXiv · doi:10.48550/arxiv.1511.07122 · Cited by 7,738 · cited 1×
“e dierence is relatively minor: see Section 4.1. 3.1.4 Dilation Dilation is used to ‘spread’ a kernel over the input. For dilation, d, a given kernel is convolved with every dth element of the input [38, 8]. Each kernel is assigned the same xed set of dilations, adjusted to the length of the input time series. We spec…”
BackgroundInfluentialDeep 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 · cited 1×
“Figures showing mean ranks were produced using code from [15].”
MethodInceptiontime: 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 · cited 3×
“According to [2, 28, 27], the most accurate current methods for time series classification are HIVE-COTE and its variants [22], TS-CHIEF [36], InceptionTime [16], and Rocket [8].”
MethodSelf-citationGarcía, S., & Herrera, F. (2008) · Institutional Repository of the University of Granada (University of Granada) · Cited by 1,619
Numba: a LLVM-based Python JIT compiler
Lam, S. K., Pitrou, A., & Seibert, S. (2015) · Proceedings of the Second Workshop on the LLVM Compiler Infrastructure in HPC · doi:10.1145/2833157.2833162 · Cited by 1,514
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
Dau, H. A., Bagnall, A., Kamgar, K., Yeh, C.-C. M., Zhu, Y., Gharghabi, S., Ratanamahatana, C. A., & Keogh, E. (2019) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2019.1911747 · Cited by 1,128
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
ESPNet: Efficient Spatial Pyramid of Dilated Convolutions for Semantic Segmentation
Mehta, S., Rastegari, M., Caspi, A., Shapiro, L., & Hajishirzi, H. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01249-6_34 · Cited by 1,029
Dempster, A., Petitjean, F., & Webb, G. I. (2020) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-020-00701-z · Cited by 982
Self-citationThe 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
Lubba, C. H., Sethi, S. S., Knaute, P., Schultz, S. R., Fulcher, B. D., & Jones, N. S. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-019-00647-x · Cited by 431
Shift: A Zero FLOP, Zero Parameter Alternative to Spatial Convolutions
Wu, B., Wan, A., Yue, X., Jin, P., Zhao, S., Golmant, N., Gholaminejad, A., Gonzalez, J., & Keutzer, K. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00951 · Cited by 381
Lines, J., Taylor, S., & Bagnall, A. (2018) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3182382 · Cited by 333
Local Binary Convolutional Neural Networks
Juefei-Xu, F., Boddeti, V. N., & Savvides, M. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.456 · Cited by 297
Should we really use post-hoc tests based on mean-ranks?
Benavoli, A., Giorgio Corani, A., & Mangili, F. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1505.02288 · Cited by 284
Generalized random shapelet forests
Karlsson, I., Papapetrou, P., & Boström, H. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0473-y · Cited by 169
Proximity Forest: an effective and scalable distance-based classifier for time series
Lucas, B., Shifaz, A., Pelletier, C., O’Neill, L., Zaidi, N., Goethals, B., Petitjean, F., & Webb, G. I. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-019-00617-3 · Cited by 164
Self-citationFlying Insect Classification with Inexpensive Sensors
Chen, Y., Why, A., Batista, G., Mafra‐Neto, A., & Keogh, E. (2014) · Journal of Insect Behavior · doi:10.1007/s10905-014-9454-4 · Cited by 162
Mosquito wingbeat analysis and classification using deep learning
Fanioudakis, E., Geismar, M., & Potamitis, I. (2018) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco.2018.8553542 · Cited by 65
Bagnall, A. J., Flynn, M., Large, J., Lines, J., & Middlehurst, M. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-65742-0_1 · Cited by 63
Turning wingbeat sounds into spectrum images for acoustic insect classification
Zhang, C., Wang, P., Guo, H. N., et al. (2017) · Electronics Letters · doi:10.1049/el.2017.3334 · Cited by 14
Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activations
Hubara, I., Courbariaux, M., Soudry, D., El-Yaniv, R., & Bengio, Y. (2016) · arXiv · doi:10.48550/arxiv.1609.07061
Cited by
Deep Learning for Time Series Classification and Extrinsic Regression: A Current Survey
Mohammadi Foumani, N., Miller, L., Tan, C. W., Webb, G. I., Forestier, G., & Salehi, M. (2024) · ACM Computing Surveys · doi:10.1145/3649448 · Cited by 268
Self-citationTARNet: Task-Aware Reconstruction for Time-Series Transformer
Chowdhury, R. R., Zhang, X., Shang, J., Gupta, R. K., & Hong, D. (2022) · Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3534678.3539329 · Cited by 68
“(6) MiniRocket [6] upgrades Rocket by speeding it up, using a small, fixed set of kernels, and is almost entirely deterministic.”
BackgroundNazir, A., Mitra, R., Sulieman, H., & Kamalov, F. (2023) · Sensors · doi:10.3390/s23135811 · Cited by 30
Yan, J., Wang, X., Shi, J., & Hu, S. (2023) · Sensors · doi:10.3390/s23042153 · Cited by 28
Metadata
- Authors
- Dempster, A., Schmidt, D. F., & Webb, G. I.
- Venue
- Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining
- Publisher
- ACM
- Published
- 2021-08-14
- Pages
- 248-257
- OpenAlex
- W3112330479
- Cited by
- 490
- References
- 24
- FWCI
- 45.82
- Type
- conference paper
- Language
- en
- Open access
- green
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.