Results 251 to 260 of about 13,661 (279)
Predictability analysis of absence seizures with permutation entropy
Epilepsy Research, 2007 In this study, we investigate permutation entropy as a tool to predict the absence seizures of genetic absence epilepsy rats from Strasbourg (GAERS) by using EEG recordings. The results show that permutation entropy can track the dynamical changes of EEG
Xiaoli Li, Gaoxiang Ouyang
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the permutation entropy Bayesian estimation
Communications in Nonlinear Science and Numerical Simulation, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernando E. Pose +3 more
openaire +3 more sources
Communications in Statistics - Simulation and Computation, 2010
Sample entropy (SaEn) was recently developed to quantify the amount of regularity in data. However, the computation of this feature in an online application is infeasible. In this work, we examine a heuristic approach using permuted limited number of samples to estimate SaEn and discuss estimation variability in this context.
Afshin Samani, Pascal Madeleine
openaire +1 more source
Sample entropy (SaEn) was recently developed to quantify the amount of regularity in data. However, the computation of this feature in an online application is infeasible. In this work, we examine a heuristic approach using permuted limited number of samples to estimate SaEn and discuss estimation variability in this context.
Afshin Samani, Pascal Madeleine
openaire +1 more source
International Journal of Bifurcation and Chaos, 1995
The entropy of a permutation is the (topological) entropy of the "connect-the-dots" map determined by it. We give matrix- and graph-theoretic, geometric, and dynamical characterizations of zero entropy permutations, as well as a procedure for constructing all of them. We also include some information about the number of zero entropy permutations.
Block, Louis +2 more
openaire +2 more sources
The entropy of a permutation is the (topological) entropy of the "connect-the-dots" map determined by it. We give matrix- and graph-theoretic, geometric, and dynamical characterizations of zero entropy permutations, as well as a procedure for constructing all of them. We also include some information about the number of zero entropy permutations.
Block, Louis +2 more
openaire +2 more sources
PARAMETER SELECTION FOR PERMUTATION ENTROPY MEASUREMENTS
International Journal of Bifurcation and Chaos, 2007We investigate the applicability of the permutation entropy H and a synchronization index γ that is based on the changing tendency of temporal permutation entropies to analyze noisy time series from nonstationary dynamical systems with poorly understood properties. Using model systems, we first study the interdependencies of parameters involved in the
Matthäus Staniek, Klaus Lehnertz
openaire +2 more sources
IEEE Signal Processing Letters, 2015
Multiscale permutation entropy (MPE) has recently been proposed to evaluate complexity of time series. MPE has numerous advantages over other multiscale complexity measures, such as its simplicity, robustness to noise and its low computational cost.
Anne Humeau-Heurtier +2 more
openaire +1 more source
Multiscale permutation entropy (MPE) has recently been proposed to evaluate complexity of time series. MPE has numerous advantages over other multiscale complexity measures, such as its simplicity, robustness to noise and its low computational cost.
Anne Humeau-Heurtier +2 more
openaire +1 more source
EEG Signal Discrimination with Permutation Entropy
2021The information analysis of the electroencephalogram (EEG) signal is carried out by granulation and reciprocal entropy (PeEn). The analysis of the EEG signal is obtained by experimental activity. Due to its complexity and multichannel characteristic, together with granular computing (GrC) and PeEn are used to analyze the EEG signal.
Youpeng Yang +2 more
openaire +1 more source
Scrambling permutations and entropy of hypergraphs
Random Structures and Algorithms, 1996The main result is the following: If \(\pi_1,\dots, \pi_d\) are permutations of the \(n\) element set \(P\) such that for every triple \(x, y, z\in P\), one can find a \(\pi_i\) such that \(\pi_i(x)\) is between \(\pi_i(y)\) and \(\pi_i(z)\), then \(n< \exp(d/2)\). Several open problems are are announced.
openaire +2 more sources
Permutation entropy with vector embedding delays
Physical Review E, 2017Permutation entropy (PE) is a statistic used widely for the detection of structure within a time series. Embedding delay times at which the PE is reduced are characteristic timescales for which such structure exists. Here, a generalized scheme is investigated where embedding delays are represented by vectors rather than scalars, permitting PE to be ...
Douglas J, Little, Deb M, Kane
openaire +2 more sources
Analysis and Comparison of Permutation Entropy, Approximate Entropy and Sample Entropy
2018 International Symposium on Computer, Consumer and Control (IS3C), 2018Permutation entropy, approximate entropy and sample entropy can be used to measure the complexity of time series. The sinusoidal signal changed with length, amplitude, phase and frequency is measured by these three kinds of entropy. Simulation results show that the entropy value is stable when the data length is longer than some value, for example ...
Hong Zhang, Sha-sha He
openaire +1 more source