Affiliations: [a] Department of Computer Science and Telekom Innovation Laboratories, Ben-Gurion University of The Negev, Be'er Sheva, Israel | [b] Department of Information Systems Engineering and Telekom Innovation Laboratories, Ben-Gurion University of The Negev, Be'er Sheva, Israel
Correspondence:
[*]
Corresponding author: Daniel Gordon, Department of Computer Science and Telekom Innovation Laboratories, Ben-Gurion University of The Negev, Be'er Sheva 84105, Israel. Tel.: +972 0 8642 8782; Fax: +972 0 8647 7650; E-mail:[email protected]
Abstract: Time series classification is a research area which has drawn much attention over the past decade. A novel approach for classification of time series uses shapelets. A shapelet is a subsequence extracted from one of the time series in the dataset which best separates between time series coming from different classes of the data set. A disadvantage of current shapelet-based classification approaches is their high time and memory consumption, which results from the examination of all possible subsequences. In this study, our initial goal was to find an evaluation order of the shapelets space which enables fast generation of an accurate classification model with a small memory footprint. The comparative analysis we conducted clearly indicates that a random evaluation order yields the best results. We present an algorithm for randomized model generation for shapelet-based classification that can generate a model with surprisingly high accuracy after evaluating only an exceedingly small fraction (∼ 10-3) of the shapelets space and has modest memory requirements. We propose several methods for estimating the number of shapelets to examine, and present extensive evaluation on 51 data sets establishing the effectiveness of our approach.
