Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.19955 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909755663974400 |
|---|---|
| author | Avhale, Abhijeet Diehl, Joscha Velankar, Niraj Verri, Emanuele |
| author_facet | Avhale, Abhijeet Diehl, Joscha Velankar, Niraj Verri, Emanuele |
| contents | Permutation Entropy, introduced by Bandt and Pompe, is a widely used complexity measure for real-valued time series that is based on the relative order of values within consecutive segments of fixed length. After standardizing each segment to a permutation and computing the frequency distribution of these permutations, Shannon Entropy is then applied to quantify the series' complexity. We introduce Global Permutation Entropy (GPE), a novel index that considers all possible patterns of a given length, including non-consecutive ones. Its computation relies on recently developed algorithms that enable the efficient extraction of full permutation profiles. We illustrate some properties of GPE and demonstrate its effectiveness through experiments on synthetic datasets, showing that it reveals structural information not accessible through standard permutation entropy. We provide a Julia package for the calculation of GPE at `https://github.com/AThreeH1/Global-Permutation-Entropy'. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_19955 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Global Permutation Entropy Avhale, Abhijeet Diehl, Joscha Velankar, Niraj Verri, Emanuele Machine Learning Information Theory 62M10 (primary), 94A17 (secondary) Permutation Entropy, introduced by Bandt and Pompe, is a widely used complexity measure for real-valued time series that is based on the relative order of values within consecutive segments of fixed length. After standardizing each segment to a permutation and computing the frequency distribution of these permutations, Shannon Entropy is then applied to quantify the series' complexity. We introduce Global Permutation Entropy (GPE), a novel index that considers all possible patterns of a given length, including non-consecutive ones. Its computation relies on recently developed algorithms that enable the efficient extraction of full permutation profiles. We illustrate some properties of GPE and demonstrate its effectiveness through experiments on synthetic datasets, showing that it reveals structural information not accessible through standard permutation entropy. We provide a Julia package for the calculation of GPE at `https://github.com/AThreeH1/Global-Permutation-Entropy'. |
| title | Global Permutation Entropy |
| topic | Machine Learning Information Theory 62M10 (primary), 94A17 (secondary) |
| url | https://arxiv.org/abs/2508.19955 |