Time series classification has attracted significant interest over the past decade. One of the promising approaches is shapelet based algorithms, which are interpretable, more accurate and faster than most classifiers. However, the training time of shapelet based algorithms is high, even though it is computed off-line. To overcome this problem, in this paper, we propose a fast shapelet selection algorithm (FSS), which sharply reduces the time consumption of shapelet selection. In our algorithm, we first sample some time series from a training dataset with the help of a subclass splitting method. Then FSS identifies the local farthest deviation points (LFDPs) for the sampled time series and selects the subsequences between two nonadjacent LFDPs as shapelet candidates. Using these two steps, the number of shapelet candidates is greatly reduced, which leads to an obvious reduction in time complexity. Unlike other methods that accelerate the shapelet selection process at the expense of a reduction in accuracy, the experimental results demonstrate that FSS is thousands of times faster than the original shapelet transformation method, with no reduction in accuracy. Our results also demonstrate that our method is the fastest among shapelet based methods that have the leading level of accuracy.
This repository provides a python numpy implementation of the shapelet candidate selection algorithm from the paper
Ji, Cun & Zhao, Chao & Liu, Shijun & Yang, Chenglei & Li, Pan & Wu, Lei & Meng, Xiangxu. (2019). A Fast Shapelet Selection Algorithm for Time Series Classification. Computer Networks. 148. 10.1016/j.comnet.2018.11.031.
See the paper for a more detailed description.
shapelet_selection = FastShapeletCandidates(n_lfdp = n_lfdp)
shapelet_candidates = shapelet_selection.transform(data)See the demo for a more detailed example.
Released under MIT License. The code was implemented by Benedikt Bäumle.
The algorithm was developed with the aid of the library numpy.