Castor: Competing shapelets for fast and accurate time series classification

Isak Samsten, Zed Lee
3/19/2024
cs.LGcs.CV

No official code found. Best implementation: isaksamsten/castor (3 stars, BSD-3-Clause, last commit 2024-05-13).

Abstract

Shapelets are discriminative subsequences, originally embedded in shapelet-based decision trees but have since been extended to shapelet-based transformations. We propose Castor, a simple, efficient, and accurate time series classification algorithm that utilizes shapelets to transform time series. The transformation organizes shapelets into groups with varying dilation and allows the shapelets to compete over the time context to construct a diverse feature representation. By organizing the shapelets into groups, we enable the transformation to transition between levels of competition, resulting in methods that more closely resemble distance-based transformations or dictionary-based transformations. We demonstrate, through an extensive empirical investigation, that Castor yields transformations that result in classifiers that are significantly more accurate than several state-of-the-art classifiers. In an extensive ablation study, we examine the effect of choosing hyperparameters and suggest accurate and efficient default values.

View on arXivView PDF

Code Implementations(1)

isaksamsten/castorCommunity100%
BSD-3-Clause
30Jupyter NotebookJan 25, 20242 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{samsten2024castor,
  title  = {Castor: Competing shapelets for fast and accurate time series classification},
  author = {Isak Samsten and Zed Lee},
  year   = {2024},
  eprint = {2403.13176},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.13176v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.13176.svg)](https://codeofpaper.com/paper/2403.13176)

Discussion