Entropies from Markov models as complexity measures of embedded attractors
From MaRDI portal
(Redirected from Publication:296368)
Abstract: This paper addresses the problem of measuring complexity from embedded attractors as a way to characterize changes in the dynamical behaviour of different types of systems by observing their outputs. With the aim of measuring the stability of the trajectories of the attractor along time, this paper proposes three new estimations of entropy that are derived from a Markov model of the embedded attractor.
Cites work
- scientific article; zbMATH DE number 3810550 (Why is no real title available?)
- scientific article; zbMATH DE number 1145169 (Why is no real title available?)
- Adaptive Blind Deconvolution of Linear Channels Using Renyi's Entropy with Parzen Window Estimation
- Approximate entropy as a measure of system complexity.
- Chaos
- Elements of Information Theory
- Entropy measures for biological signal analyses
- Hidden Markov Models and Dynamical Systems
- Hidden Markov processes
- Locally defined principal curves and surfaces
- Machine learning. A probabilistic perspective
- Multivariate multi-scale permutation entropy for complexity analysis of Alzheimer's disease EEG
- On some convergence properties of the subspace constrained mean shift
- On the concept of attractor
- Practical method for determining the minimum embedding dimension of a scalar time series
- Statistical mechanics and information-theoretic perspectives on complexity in the Earth system
- The effect of time delay on approximate \& sample entropy calculations
This page was built for publication: Entropies from Markov models as complexity measures of embedded attractors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296368)
