Permutation Entropy: A Natural Complexity Measure for Time Series
Top Cited Papers
- 11 April 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 88 (17) , 174102
- https://doi.org/10.1103/physrevlett.88.174102
Abstract
We introduce complexity parameters for time series based on comparison of neighboring values. The definition directly applies to arbitrary real-world data. For some well-known chaotic dynamical systems it is shown that our complexity behaves similar to Lyapunov exponents, and is particularly useful in the presence of dynamical or observational noise. The advantages of our method are its simplicity, extremely fast calculation, robustness, and invariance with respect to nonlinear monotonous transformations.Keywords
This publication has 12 references indexed in Scilit:
- Orbit complexity and data compressionDiscrete & Continuous Dynamical Systems, 2001
- Validity of Threshold-Crossing Analysis of Symbolic Dynamics from Chaotic Time SeriesPhysical Review Letters, 2000
- Analysis of Observed Chaotic DataPublished by Springer Nature ,1996
- Plateau onset for correlation dimension: When does it occur?Physical Review Letters, 1993
- The entropy profile ? A function describing statistical dependencesJournal of Statistical Physics, 1993
- Finite sample corrections to entropy and dimension estimatesPhysics Letters A, 1988
- Generating partitions for the dissipative Hénon mapPhysics Letters A, 1985
- Ergodic theory of chaos and strange attractorsReviews of Modern Physics, 1985
- Estimation of the Kolmogorov entropy from a chaotic signalPhysical Review A, 1983
- Definition of entropy by means of a coding problemProbability Theory and Related Fields, 1966