Forests of Randomized Shapelet Trees

Isak Karlsson, Panagiotis Papapetrou, Henrik Boström

Abstract

Shapelets have recently been proposed for data series classification, due to their ability to capture phase independent and local information. Decision trees based on shapelets have been shown to provide not only interpretable models, but also, in many cases, state-of-the-art predictive performance. Shapelet discovery is, however, computationally costly, and although several techniques for speeding up this task have been proposed, the computational cost is still in many cases prohibitive. In this work, an ensemble-based method, referred to as Random Shapelet Forest (RSF), is proposed, which builds on the success of the random forest algorithm, and which is shown to have a lower computational complexity than the original shapelet tree learning algorithm. An extensive empirical investigation shows that the algorithm provides competitive predictive performance and that a proposed way of calculating importance scores can be used to successfully identify influential regions.
BibTeX
@inproceedings{karlsson2015forests,
  author = {Isak Karlsson and Panagiotis Papapetrou and Henrik Boström},
  title = {{Forests of Randomized Shapelet Trees}},
  booktitle = {SLDS},
  year = {2015},
  doi = {10.1007/978-3-319-17091-6\_8},
}

Loading related content...

Figure