Entropies from Markov models as complexity measures of embedded attractors
From MaRDI portal
Publication:296368
DOI10.3390/E17063595zbMATH Open1343.62045arXiv1405.2987OpenAlexW1487397800MaRDI QIDQ296368FDOQ296368
Juan I. Godino-Llorente, Julián D. Arias-Londoño
Publication date: 15 June 2016
Published in: Entropy (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1405.2987
Cites Work
- Elements of Information Theory
- Hidden Markov processes
- Machine learning. A probabilistic perspective
- Title not available (Why is that?)
- Approximate entropy as a measure of system complexity.
- Title not available (Why is that?)
- Multivariate multi-scale permutation entropy for complexity analysis of Alzheimer's disease EEG
- On the concept of attractor
- Entropy measures for biological signal analyses
- Statistical mechanics and information-theoretic perspectives on complexity in the Earth system
- The effect of time delay on approximate \& sample entropy calculations
- Practical method for determining the minimum embedding dimension of a scalar time series
- Hidden Markov Models and Dynamical Systems
- Title not available (Why is that?)
- Adaptive Blind Deconvolution of Linear Channels Using Renyi's Entropy with Parzen Window Estimation
- Chaos
- On some convergence properties of the subspace constrained mean shift
Uses Software
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)
