Abstract
AbstractWhen dealing with a new time series classification problem, modellers do not know in advance which features could enable the best classification performance. We propose an evolutionary algorithm based on grammatical evolution to attain a data-driven feature-based representation of time series with minimal human intervention. The proposed algorithm can select both the features to extract and the sub-sequences from which to extract them. These choices not only impact classification performance but also allow understanding of the problem at hand. The algorithm is tested on 30 problems outperforming several benchmarks. Finally, in a case study related to subject authentication, we show how features learned for a given subject are able to generalise to subjects unseen during the extraction phase.
Funder
University College Dublin
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference55 articles.
1. H. Abdi, Holm’s sequential bonferroni procedure. Encycl. Res. Des. 1(8), 1–8 (2010)
2. A. Agapitos, R. Loughran, M. Nicolau, S. Lucas, M. O’Neill, A. Brabazon, A survey of statistical machine learning elements in genetic programming. IEEE Trans. Evol. Comput. 23(6), 1029–1048 (2019)
3. R.J. Alcock, Y. Manolopoulos, et al., Time-series similarity queries employing a feature-based approach. In: 7th Hellenic conference on informatics, pp 27–29 (1999)
4. S. Aminikhanghahi, D.J. Cook, A survey of methods for time series change point detection. Knowl. Inf. Syst. 51(2), 339–367 (2017)
5. A. Bagnall, J. Lines, A. Bostrom, J. Large, E. Keogh, The great time series classification bake off: a review and experimental evaluation of recent algorithmic advances. Data Min. Knowl. Discov. 31(3), 606–660 (2017)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献