Approximate Entropy and especially Sample Entropy are recently frequently used algorithms for calculating the measure of complexity of a time series. A lesser known fact is that there are also accelerated modifications of these two algorithms, namely Fast Approximate Entropy and Fast Sample Entropy. All these algorithms are effectively implemented in the R software package TSEntropies. This paper contains not only an explanation of all these algorithms, but also the principle of their acceleration. Furthermore, the paper contains a description of the functions of this software package and their parameters, as well as simple examples of using this software package to calculate these measures of complexity of an artificial time series and the time series of a complex real-world system represented by the course of supercomputer infrastructure power consumption. These time series were also used to test the speed of this package and to compare its speed with another R package pracma. The results show that TSEntropies is up to 100 times faster than pracma and another important result is that the computational times of the new Fast Approximate Entropy and Fast Sample Entropy algorithms are up to 500 times lower than the computational times of their original versions. At the very end of this paper, the possible use of this software package TSEntropies is proposed.

IT4Innovations VSB Technical University of Ostrava 17 listopadu 2172 15 70833 Ostrava Poruba Czech Republic

Zobrazit více v PubMed

Gottwald G.A., Melbourne I. A new test for chaos in deterministic systems. Proc. R. Soc. Lond. Ser. A. 2004;460:603–611. doi: 10.1098/rspa.2003.1183. DOI

Shilnikov L.P. A case of the existence of a denumerable set of periodic motion. Sov. Math. Dokl. 1965;6:163–166.

Clausius R. The Mechanical Theory of Heat, Nine Memoirs on the Development of Concept of “Entropy”. John Van Voorst, 1 Paternoster Row; London, UK: 1867.

Pincus S.M. Approximate entropy as a measure of system complexity. Proc. Natl. Acad. Sci. USA. 1991;88:2297–2301. doi: 10.1073/pnas.88.6.2297. PubMed DOI PMC

Richman J.S., Moorman J.R. Physiological time-series analysis using approximate entropy and sample entropy. Am. J. Physiol. Heart Circ. Physiol. 2000;278:2039–2049. doi: 10.1152/ajpheart.2000.278.6.H2039. PubMed DOI

Tomčala J. Acceleration of time series entropy algorithms. J. Supercomput. 2019;75:1443–1454. doi: 10.1007/s11227-018-2657-2. DOI

IT4Innovations (2020): Anselm, Salomon, DGX-2, and Barbora Supercomputer Clusters Located at IT4Innovations, National Supercomputing Center. VSB—Technical University of Ostrava, Czech Republic. [(accessed on 3 August 2020)]; Available online: https://www.it4i.cz/en.

Tomčala J. Predictability and Entropy of Supercomputer Infrastructure Consumption. In: Stavrinides S., Ozer M., editors. Chaos Complex Systems, Proceedings of the 5th International Interdisciplinary Chaos Symposium, 9–12 May 2019, Antalya, Turkey. Volume 10. Springer; Cham, Switzerland: 2020. pp. 59–66. DOI

Tomcala J. TSEntropies: Time Series Entropies. [(accessed on 3 August 2020)];2018 R package. Available online: https://CRAN.R-project.org/package=TSEntropies.

Borchers H.W. Pracma: Practical Numerical Math Functions. [(accessed on 3 August 2020)];2019 R package. Available online: https://CRAN.R-project.org/package=pracma.

R Core Team . R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing; Vienna, Austria: 2019. [(accessed on 3 August 2020)]. Available online: https://www.R-project.org.

Recurrence quantification analysis for fine-scale characterisation of arrhythmic patterns in cardiac tissue