In this work, we present a novel algorithm for time series discretization. Our approach includes the optimization of the word size and the alphabet as one parameter. Using evolutionary programming, the search for a good discretization scheme is guided by a cost function which considers three criteria: the entropy regarding the classification, the complexity measured as the number of different strings needed to represent the complete data set, and the compression rate assessed as the length of the discrete representation. Our proposal is compared with some of the most representative algorithms found in the specialized literature, tested in a well-known benchmark of time series data sets. The statistical analysis of the classification accuracy shows that the overall performance of our algorithm is highly competitive. © 2011 Springer-Verlag.
CITATION STYLE
Rechy-Ramírez, F., Mesa, H. G. A., Mezura-Montes, E., & Cruz-Ramírez, N. (2011). Times series discretization using evolutionary programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7095 LNAI, pp. 225–234). https://doi.org/10.1007/978-3-642-25330-0_20
Mendeley helps you to discover research relevant for your work.