On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration
Data Mining and Knowledge Discovery
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
Proceedings of the VLDB Endowment
Time series shapelets: a new primitive for data mining
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Support vector machines of interval-based features for time series classification
Knowledge-Based Systems
Time series shapelets: a novel technique that allows accurate, interpretable and fast classification
Data Mining and Knowledge Discovery
Weighted dynamic time warping for time series classification
Pattern Recognition
Logical-shapelets: an expressive primitive for time series classification
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
On the extraction and classification of hand outlines
IDEAL'11 Proceedings of the 12th international conference on Intelligent data engineering and automated learning
Alternative quality measures for time series shapelets
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
A time series forest for classification and feature extraction
Information Sciences: an International Journal
Classification of time series by shapelet transformation
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
The problem of time series classification (TSC), where we consider any real-valued ordered data a time series, presents a specific machine learning challenge as the ordering of variables is often crucial in finding the best discriminating features. One of the most promising recent approaches is to find shapelets within a data set. A shapelet is a time series subsequence that is identified as being representative of class membership. The original research in this field embedded the procedure of finding shapelets within a decision tree. We propose disconnecting the process of finding shapelets from the classification algorithm by proposing a shapelet transformation. We describe a means of extracting the k best shapelets from a data set in a single pass, and then use these shapelets to transform data by calculating the distances from a series to each shapelet. We demonstrate that transformation into this new data space can improve classification accuracy, whilst retaining the explanatory power provided by shapelets.