Most methods for time series classification that attain state-of-the-art accuracy have high computational complexity, requiring significant training time even for smaller datasets, and are intractable for larger datasets. Additionally, many existing methods focus on a single type of feature such as shape or frequency. Building on the recent success of convolutional neural networks for time series classification, we show that simple linear classifiers using random convolutional kernels achieve state-of-the-art accuracy with a fraction of the computational expense of existing methods.
ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernels
Simple linear classifiers with random convolutional kernels achieve high accuracy in time series classification with lower computational costs compared to existing methods.
- Year
- 2019
- Venue
- arXiv 2019
- Authors
- 3
- Hosting
- Abstract onlyARXIV-DEFAULT
Cite
Notes
Only stored in your browser.
Attribution
- Abstract & full text
- arxiv.org/abs/1910.13051ARXIV-DEFAULT
- TL;DR
- Semantic Scholar