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

Áreas de investigación:

• Methodology - Machine learning

Año:

2018

Tipo de publicación:

Artículo en conferencia

Palabras clave:

Time series size reduction, Segmentation, Coral reefs optimization, Memetic algorithms

Autores:

• Durán-Rosal, Antonio Manuel
• Gutiérrez, Pedro Antonio
• Salcedo-Sanz, Sancho
• Hervás-Martínez, César

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:

@conference{CROCAEPIA2018, author = "Antonio Manuel Dur{\'a}n-Rosal and Pedro Antonio Guti{\'e}rrez and Sancho Salcedo-Sanz and C{\'e}sar Herv{\'a}s-Mart{\'i}nez", 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.", booktitle = "Proceedings of the 2018 Conference of the Spanish Association for Artificial Intelligence (CAEPIA2018)", doi = "10.1007/978-3-030-00374-6_20", isbn = "978-3-030-00373-9", issn = "0302-9743", keywords = "Time series size reduction, Segmentation, Coral reefs optimization, Memetic algorithms ", month = "23rd-28th September", organization = "Granada (Spain)", pages = "209-218", series = "Lecture Notes in Computer Science", title = "{A}n {E}mpirical {V}alidation of a {N}ew {M}emetic {CRO} {A}lgorithm for the {A}pproximation of {T}ime {S}eries", url = "doi.org/10.1007/978-3-030-00374-6_20", volume = "11160", year = "2018", }

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.