Efficiently Measuring Complexity on the Basis of Real-World Data
Permutation entropy, introduced by Bandt and Pompe, is a conceptually simple and well-interpretable measure of time series complexity. In this paper, we propose efficient methods for computing it and related ordinal-patterns-based characteristics. The methods are based on precomputing values of succ...
Main Authors: | Valentina A. Unakafova, Karsten Keller |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2013-10-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/15/10/4392 |
Similar Items
-
Ordinal Patterns, Entropy, and EEG
by: Karsten Keller, et al.
Published: (2014-11-01) -
Algorithmics, Possibilities and Limits of Ordinal Pattern Based Entropies
by: Albert B. Piek, et al.
Published: (2019-05-01) -
Permutation Entropy: Too Complex a Measure for EEG Time Series?
by: Sebastian Berger, et al.
Published: (2017-12-01) -
Ordinal Pattern Based Entropies and the Kolmogorov–Sinai Entropy: An Update
by: Tim Gutjahr, et al.
Published: (2020-01-01) -
Permutation Entropy: New Ideas and Challenges
by: Karsten Keller, et al.
Published: (2017-03-01)