The Journal of Supercomputing

, Volume 75, Issue 3, pp 1443–1454 | Cite as

Acceleration of time series entropy algorithms

  • Jiří TomčalaEmail author


This paper concentrates on the entropy estimation of time series. Two new algorithms are introduced: Fast Approximate Entropy and Fast Sample Entropy. Their main advantage is their lower time complexity. Examples considered in the paper include interesting experiments with real-world data obtained from IT4Innovations’ supercomputers Salomon and Anselm, as well as with data artificially created specifically to test the credibility of these new entropy analyzers.


Entropy Approximate entropy Sample entropy Fast Approximate Entropy Fast Sample Entropy 



This work has been supported by the Large Infrastructures for Research, Experimental Development and Innovations project “IT4Innovations National Supercomputing Center LM2015070.”


  1. 1.
    Garfinkel A, Shevtsov J, Guo Y (2017) Modeling life: the mathematics of biological systems, vol 445. Springer, BerlinCrossRefzbMATHGoogle Scholar
  2. 2.
    Gottwald GA, Melbourne I (2004) A new test for chaos in deterministic systems. Proc R Soc Lond A Math Phys Eng Sci 460(2042):603–611MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Gottwald GA, Melbourne I (2009) On the implementation of the 0–1 test for chaos. SIAM J Appl Dyn Syst 8(1):129–145MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Lampart M, Zapoměl J (2016) Dynamical properties of a non-autonomous bouncing ball model forced by non-harmonic excitation. Math Methods Appl Sci 39(16):4923–4929MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Martinovič T (2018) Chaotic behaviour of noisy traffic data. Math Methods Appl 41(6):2287–2293MathSciNetzbMATHGoogle Scholar
  6. 6.
    R Core Team (2018) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria. Accessed 22 Oct 2018
  7. 7.
    Martinovič T (2018) Chaos01: 0–1 test for chaos, R package version 1.1.1, CRAN repository. Accessed 22 Oct 2018
  8. 8.
    Clausius R (1850–1865) The mechanical theory of heat, nine memoirs on the development of concept of “entropy”Google Scholar
  9. 9.
    Shannon E (1948) A mathematical theory of communication. Bell Syst Tech J 27:379–423, 623–656Google Scholar
  10. 10.
    Balibrea F (2016) On problems of Topological Dynamics in non-autonomous discrete systems. Appl Math Nonlinear Sci 1(2):391–404MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Pincus SM (1991) Approximate entropy as a measure of system complexity. Proc Natl Acad Sci USA 88:2297–2301MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Pincus SM, Kalman RE (2004) Irregularity, volatility, risk, and financial market time series. Proc Natl Acad Sci USA 101(38):13709–13714MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Taghavi M, Boostani R, Sabeti M, Taghavi SMA (2011) Usefulness of approximate entropy in the diagnosis of Schizophrenia. Iranian J Psychiatry Behav Sci 5(2):62–70Google Scholar
  14. 14.
    Zhou Y, Huang R, Chen Z, Chang X, Chen J, Xie L (2012) Application of approximate entropy on dynamic characteristics of epileptic absence seizure. Neural Regener Res 7(8):572–577Google Scholar
  15. 15.
    Richman JS, Moorman JR (2000) Physiological time-series analysis using approximate entropy and sample entropy. Am J Physiol Heart Circul Physiol 278:2039–2049CrossRefGoogle Scholar
  16. 16.
    Borchers HW (2018) pracma: Practical Numerical Math Functions, R package version 2.1.4, CRAN repository. Accessed 22 Oct 2018

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.IT4InnovationsVŠB - Technical University of OstravaOstrava, PorubaCzech Republic

Personalised recommendations