On the Automatic Parameter Selection for Permutation Entropy
May 15, 2019 Β· Declared Dead Β· π Chaos
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Audun Myers, Firas Khasawneh
arXiv ID
1905.06443
Category
physics.data-an
Cross-listed
cs.IT,
nlin.CD
Citations
43
Venue
Chaos
Last Checked
1 month ago
Abstract
Permutation Entropy (PE) has been shown to be a useful tool for time series analysis due to its low computational cost and noise robustness. This has drawn for its successful application in many fields. Some of these include damage detection, disease forecasting, and financial volatility analysis. However, to successfully use PE, an accurate selection of two parameters is needed: the permutation dimension $n$ and embedding delay $Ο$. These parameters are often suggested by experts based on a heuristic or by a trial and error approach. unfortunately, both of these methods can be time-consuming and lead to inaccurate results. To help combat this issue, in this paper we investigate multiple schemes for automatically selecting these parameters with only the corresponding time series as the input. Specifically, we develop a frequency-domain approach based on the least median of squares and the Fourier spectrum, as well as extend two existing methods: Permutation Auto-Mutual Information (PAMI) and Multi-scale Permutation Entropy (MPE) for determining $Ο$. We then compare our methods as well as current methods in the literature for obtaining both $Ο$ and $n$ against expert-suggested values in published works. We show that the success of any method in automatically generating the correct PE parameters depends on the category of the studied system. Specifically, for the delay parameter $Ο$, we show that our frequency approach provides accurate suggestions for periodic systems, nonlinear difference equations, and ECG/EEG data, while the mutual information function computed using adaptive partitions provides the most accurate results for chaotic differential equations. For the permutation dimension $n$, both False Nearest Neighbors and MPE provide accurate values for $n$ for most of the systems with $n = 5$ being suitable in most cases.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.data-an
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
A deep convolutional neural network approach to single-particle recognition in cryo-electron microscopy
R.I.P.
π»
Ghosted
The Pandora Software Development Kit for Pattern Recognition
R.I.P.
π»
Ghosted
Emergence of Compositional Representations in Restricted Boltzmann Machines
R.I.P.
π»
Ghosted
Investigating echo state networks dynamics by means of recurrence analysis
R.I.P.
π»
Ghosted
Discovering state-parameter mappings in subsurface models using generative adversarial networks
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted