Entropies from Markov models as complexity measures of embedded attractors

17Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

This paper addresses the problem of measuring complexity from embedded attractors as a way to characterize changes in the dynamical behavior of different types of systems with a quasi-periodic behavior 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. The proposed estimators are compared with traditional nonparametric entropy measures, such as approximate entropy, sample entropy and fuzzy entropy, which only take into account the spatial dimension of the trajectory. The method proposes the use of an unsupervised algorithm to find the principal curve, which is considered as the "profile trajectory", that will serve to adjust the Markov model. The new entropy measures are evaluated using three synthetic experiments and three datasets of physiological signals. In terms of consistency and discrimination capabilities, the results show that the proposed measures perform better than the other entropy measures used for comparison purposes.

Cite

CITATION STYLE

APA

Arias-Londoño, J. D., & Godino-Llorente, J. I. (2015). Entropies from Markov models as complexity measures of embedded attractors. Entropy, 17(6), 3595–3620. https://doi.org/10.3390/e17063595

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free