An Empirical Validation of a New Memetic CRO Algorithm for the Approximation of Time Series

Hits: 6070
Áreas de investigación:
Año:
2018
Tipo de publicación:
Artículo en conferencia
Palabras clave:
Time series size reduction, Segmentation, Coral reefs optimization, Memetic algorithms
Autores:
Volumen:
11160
Título del libro:
Proceedings of the 2018 Conference of the Spanish Association for Artificial Intelligence (CAEPIA2018)
Serie:
Lecture Notes in Computer Science
Páginas:
209-218
Organización:
Granada (Spain)
Mes:
23rd-28th September
ISBN:
978-3-030-00373-9
ISSN:
0302-9743
BibTex:
Abstract:
The exponential increase of available temporal data encourages the development of new automatic techniques to reduce the number of points of time series. In this paper, we propose a novel modification of the coral reefs optimization algorithm (CRO) to reduce the size of the time series with the minimum error of approximation. During the evolution, the solutions are locally optimised and reintroduced in the optimization process. The hybridization is performed using two well-known state-of-the-art algorithms, namely Bottom-Up and Top-Down. The resulting algorithm, called memetic CRO (MCRO), is compared against standard CRO, its statistically driven version (SCRO) and their hybrid versions (HCRO and HSCRO, respectively). The methodology is tested in 15 time series collected from different sources, including financial problems, oceanography data, and cardiology signals, among others, showing that the best results are obtained by MCRO.
Back