Projects per year
Abstract
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. Using this method, it is possible to train and test a classifier on all 85 ‘bake off’ datasets in the UCR archive in <2h, and it is possible to train a classifier on a large dataset of more than one million time series in approximately 1 h.
| Original language | English |
|---|---|
| Pages (from-to) | 1454–1495 |
| Number of pages | 42 |
| Journal | Data Mining and Knowledge Discovery |
| Volume | 34 |
| DOIs | |
| Publication status | Published - 13 Jul 2020 |
Keywords
- Convolution
- Random
- Scalable
- Time series classification
Projects
- 2 Finished
-
Target-agnostic analytics: Building agile predictive models for big data
Webb, G. (Primary Chief Investigator (PCI)) & Buntine, W. (Chief Investigator (CI))
1/04/19 → 30/06/22
Project: Research
-
Time series classification for new-generation Earth observation satellites
Petitjean, F. (Primary Chief Investigator (PCI))
1/06/17 → 31/12/20
Project: Research