HackerPapers

arXiv:1910.13051cs.LG

ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernels

Angus Dempster, François Petitjean, Geoffrey I. Webb

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
27 pages, 23 figures
Journal reference
DOI
doi:10.1007/s10618-020-00701-z
Subjects
cs.LGMachine Learning stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2020 to Dec 2020.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Scaling Down Deep Learning 1 comment
    • The Rocket paper [0] for time serie classification works along those lines. They use a linear classifier on top of an ensemble of random convolutions. [0]: https://arxiv.org/abs/1910.13051

      nestorDView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.