Complexity Measures and Features for Times Series classification
Francisco J. Bald\'an, Jos\'e M. Ben\'itez

TL;DR
This paper introduces a set of structural features for time series classification that balances accuracy with interpretability, providing competitive results against state-of-the-art methods.
Contribution
The work proposes interpretable characteristics for time series classification enabling traditional classifiers to perform competitively.
Findings
No statistically significant difference in accuracy compared to top models
Provides interpretable results based on structural features
Achieves competitive classification performance
Abstract
Classification of time series is a growing problem in different disciplines due to the progressive digitalization of the world. Currently, the state-of-the-art in time series classification is dominated by The Hierarchical Vote Collective of Transformation-based Ensembles. This algorithm is composed of several classifiers of different domains distributed in five large modules. The combination of the results obtained by each module weighed based on an internal evaluation process allows this algorithm to obtain the best results in state-of-the-art. One Nearest Neighbour with Dynamic Time Warping remains the base classifier in any time series classification problem for its simplicity and good results. Despite their performance, they share a weakness, which is that they are not interpretable. In the field of time series classification, there is a tradeoff between accuracy and…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTime Series Analysis and Forecasting · Anomaly Detection Techniques and Applications · Complex Systems and Time Series Analysis
