Permutation extropy: a time series complexity measure
Ritik Roshan Giri, Suchandan Kayal

TL;DR
This paper introduces permutation extropy, a new complexity measure for time series that improves upon permutation entropy by better capturing chaos and complexity in various real-world data.
Contribution
The paper proposes permutation extropy, combining permutation entropy and extropy concepts, and demonstrates its effectiveness over permutation entropy in analyzing chaotic and real-world time series.
Findings
Permutation extropy outperforms permutation entropy in chaos detection.
It is robust, fast to compute, and invariant under monotonic transformations.
The measure provides better complexity assessment in financial and health data.
Abstract
On account of a greater need for understanding the complexity of time series like physiological time series, financial time series, and many more that enter into picture for their inculpation with real-world problems, several complexity parameters have already been proposed in the literature. Permutation entropy, Lyapunov exponents are such complexity parameters out of many. In this article, we introduce a new time series complexity parameter, that is, the permutation extropy. The failure of permutation entropy in correctly specifying complexity of some chaotic time series motivates us to come up with a better complexity parameter, hence we propose this permutation extropy measure. We try to combine the ideas behind the permutation entropy and extopy to construct this measure. We also validate our proposed measure using several chaotic maps like logistic map, Henon map and Burger map.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications
