TL;DR
GENDIS introduces an evolutionary computation method for discovering shapelets in time series classification, offering a more efficient, flexible, and interpretable approach that outperforms traditional brute-force techniques.
Contribution
It proposes a novel gradient-free evolutionary approach for shapelet discovery that reduces computational complexity and enhances interpretability in time series classification.
Findings
Reduces shapelet discovery time by orders of magnitude.
Produces smaller, less redundant shapelet sets with comparable accuracy.
Shapelets do not need to be subsequences of input data.
Abstract
In the time series classification domain, shapelets are small time series that are discriminative for a certain class. It has been shown that classifiers are able to achieve state-of-the-art results on a plethora of datasets by taking as input distances from the input time series to different discriminative shapelets. Additionally, these shapelets can easily be visualized and thus possess an interpretable characteristic, making them very appealing in critical domains, such as the health care domain, where longitudinal data is ubiquitous. In this study, a new paradigm for shapelet discovery is proposed, which is based upon evolutionary computation. The advantages of the proposed approach are that (i) it is gradient-free, which could allow to escape from local optima more easily and to find suited candidates more easily and supports non-differentiable objectives, (ii) no brute-force…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
