Calculating Permutation Entropy without Permutations
A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entro...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/7163254 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849307267751477248 |
|---|---|
| author | Alexander K. Vidybida |
| author_facet | Alexander K. Vidybida |
| author_sort | Alexander K. Vidybida |
| collection | DOAJ |
| description | A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the embedding vectors do not have equal components. In the latter case, this method can be used instead of the permutation one. If embedding vectors have equal components, this method could be more precise in discriminating between similar data sets. |
| format | Article |
| id | doaj-art-22730dbda0ce42cf8e11d366d2c3208f |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-22730dbda0ce42cf8e11d366d2c3208f2025-08-20T03:54:48ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/71632547163254Calculating Permutation Entropy without PermutationsAlexander K. Vidybida0Bogolyubov Institute for Theoretical Physics, 14-b Metrolohichna Str, Kyiv 03143, UkraineA method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the embedding vectors do not have equal components. In the latter case, this method can be used instead of the permutation one. If embedding vectors have equal components, this method could be more precise in discriminating between similar data sets.http://dx.doi.org/10.1155/2020/7163254 |
| spellingShingle | Alexander K. Vidybida Calculating Permutation Entropy without Permutations Complexity |
| title | Calculating Permutation Entropy without Permutations |
| title_full | Calculating Permutation Entropy without Permutations |
| title_fullStr | Calculating Permutation Entropy without Permutations |
| title_full_unstemmed | Calculating Permutation Entropy without Permutations |
| title_short | Calculating Permutation Entropy without Permutations |
| title_sort | calculating permutation entropy without permutations |
| url | http://dx.doi.org/10.1155/2020/7163254 |
| work_keys_str_mv | AT alexanderkvidybida calculatingpermutationentropywithoutpermutations |