Algorithmics, Possibilities and Limits of Ordinal Pattern Based Entropies
1
Institute of Mathematics, University of Lübeck, D-23562 Lübeck, Germany
2
Graduate School for Computing in Medicine and Life Sciences, University of Lübeck, D-23562 Lübeck, Germany
3
Department of Mathematics, The University of Flensburg, D-24943 Flensburg, Germany
*
Author to whom correspondence should be addressed.
Entropy 2019, 21(6), 547; https://doi.org/10.3390/e21060547
Received: 15 May 2019 / Revised: 23 May 2019 / Accepted: 27 May 2019 / Published: 29 May 2019
(This article belongs to the Special Issue Entropy Measures for Data Analysis: Theory, Algorithms and Applications)
The study of nonlinear and possibly chaotic time-dependent systems involves long-term data acquisition or high sample rates. The resulting big data is valuable in order to provide useful insights into long-term dynamics. However, efficient and robust algorithms are required that can analyze long time series without decomposing the data into smaller series. Here symbolic-based analysis techniques that regard the dependence of data points are of some special interest. Such techniques are often prone to capacity or, on the contrary, to undersampling problems if the chosen parameters are too large. In this paper we present and apply algorithms of the relatively new ordinal symbolic approach. These algorithms use overlapping information and binary number representation, whilst being fast in the sense of algorithmic complexity, and allow, to the best of our knowledge, larger parameters than comparable methods currently used. We exploit the achieved large parameter range to investigate the limits of entropy measures based on ordinal symbolics. Moreover, we discuss data simulations from this viewpoint.
View Full-Text
Keywords:
symbolic analysis; ordinal patterns; Permutation entropy; conditional entropy of ordinal patterns; Kolmogorov-Sinai entropy; algorithmic complexity
▼
Show Figures
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Piek, A.B.; Stolz, I.; Keller, K. Algorithmics, Possibilities and Limits of Ordinal Pattern Based Entropies. Entropy 2019, 21, 547. https://doi.org/10.3390/e21060547
AMA Style
Piek AB, Stolz I, Keller K. Algorithmics, Possibilities and Limits of Ordinal Pattern Based Entropies. Entropy. 2019; 21(6):547. https://doi.org/10.3390/e21060547
Chicago/Turabian StylePiek, Albert B.; Stolz, Inga; Keller, Karsten. 2019. "Algorithmics, Possibilities and Limits of Ordinal Pattern Based Entropies" Entropy 21, no. 6: 547. https://doi.org/10.3390/e21060547
Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
Search more from Scilit