Skip to main content

Times Series Discretization Using Evolutionary Programming

  • Conference paper
Advances in Soft Computing (MICAI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7095))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. García-López, D.-A., Acosta-Mesa, H.-G.: Discretization of Time Series Dataset with a Genetic Search. In: Aguirre, A.H., Borja, R.M., Garciá, C.A.R. (eds.) MICAI 2009. LNCS, vol. 5845, pp. 201–212. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Acosta-Mesa, H.G., Nicandro, C.R., Daniel-Alejandro, G.-L.: Entropy Based Linear Approximation Algorithm for Time Series Discretization. In: Advances in Artificial Intelligence and Applications, vol. 32, pp. 214-224. Research in Computers Science

    Google Scholar 

  3. Dimitrova, E.S., McGee, J., Laubenbacher, E.: Discretization of Time Series Data, (2005) eprint arXiv:q-bio/0505028.

    Google Scholar 

  4. Fayyad, U., Irani, K.: Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (1993)

    Google Scholar 

  5. Fogel, L.: Intelligence Through Simulated Evolution. Forty years of Evolutionary Programming (Wiley Series on Intelligent Systems) (1999)

    Google Scholar 

  6. García-López D.A.: Algoritmo de Discretizaciǿn de Series de Tiempo Basado en Entropía y su Aplicaciǿn en Datos Colposcǿpicos. Universidad Veracruzana (2007)

    Google Scholar 

  7. Han, J., Kamber, M.: Data Mining: Concepts and Techniques (The Morgan Kaufmann Series in Data Management Systems) (2001)

    Google Scholar 

  8. Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases. ACM Trans. Database Syst. (2002)

    Google Scholar 

  9. Keogh, E., Lonardi, S., Ratanamabatana, C.A.: Towards parameter-free data mining. In: Proceedings of Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2001)

    Google Scholar 

  10. Keogh, E., Xi, C., Wei, L., Ratanamabatana, C.A.: The UCR Time Series Classification/Clustering Homepage (2006), http://www.cs.ucr.edu/~eamonn/time_series_data/

  11. Kurgan, L., Cios, K.: CAIM Discretization Algorithm. IEEE Transactions On Knowledge And Data Engineering (2004)

    Google Scholar 

  12. Last, M., Kandel, A., Bunke, H.: Data mining in time series databases. World Scientific Pub. Co. Inc., Singapore (2004)

    Book  MATH  Google Scholar 

  13. Lin, J., Keogh, E., Lonardi, S., Chin, B.: A symbolic representation of time series, with implications for streaming Algorithms. In: Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (2003)

    Google Scholar 

  14. Mörchen, F., Ultsch, A.: Optimizing Time Series Discretization for Knowledge Discovery. In: Proceeding of the Eleventh ACM SIGKDD international Conference on Knowledge Discovery in Data Mining (2005)

    Google Scholar 

  15. Kalyanmoy, D., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation (2002)

    Google Scholar 

  16. Trevor, H., Tibshirani, R., Friedman, J.: The elements of Statistical Learning. Springer, Heidelberg (2009)

    MATH  Google Scholar 

  17. Chiu, C., Nanh, S.C.: An adapted covering algorithm approach for modeling airplanes landing gravities. Expert Systems with Applications 26, 443–450 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rechy-Ramírez, F., Mesa, HG.A., Mezura-Montes, E., Cruz-Ramírez, N. (2011). Times Series Discretization Using Evolutionary Programming. In: Batyrshin, I., Sidorov, G. (eds) Advances in Soft Computing. MICAI 2011. Lecture Notes in Computer Science(), vol 7095. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25330-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25330-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25329-4

  • Online ISBN: 978-3-642-25330-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics