Discretization of time series dataset with a genetic search

10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we propose a new approach to the discretization of time series using an approach that applies genetic algorithm operations called GENEBLA. The basic idea is to minimize the entropy of the temporal patterns over their class labels, follow a genetic search approach that allows to find good solutions more quickly to explore a wide variety of possible ways to solve the problem at the same time. The performance of GENEBLA was evaluated using twenty temporal datasets and compared to an efficient time series discretization algorithm called SAX and EBLA3 algorithm that shows similar representation. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

García-López, D. A., & Acosta-Mesa, H. G. (2009). Discretization of time series dataset with a genetic search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5845 LNAI, pp. 201–212). https://doi.org/10.1007/978-3-642-05258-3_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free