SearcharxivSearch

arXiv · comp-gas/9512002

Coarse-grained entropy rates for characterization of complex time series

Abstract

A method for classification of complex time series using coarse-grained entropy rates (CER's) is presented. The CER's, which are computed from information-theoretic functionals -- redundancies, are relative measures of regularity and predictability, and for data generated by dynamical systems they are related to Kolmogorov-Sinai entropy. A deterministic dynamical origin of the data under study, however, is not a necessary condition for the use of the CER's, since the entropy rates can be defined for stochastic processes as well. Sensitivity of the CER's to changes in data dynamics and their robustness with respect to noise are tested by using numerically generated time series resulted from both deterministic -- chaotic and stochastic processes. Potential application of the CER's in analysis of physiological signals or other complex time series is demonstrated by using examples from pharmaco-EEG and tremor classification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Milan Palus. 1995-12-13. Coarse-grained entropy rates for characterization of complex time series. https://doi.org/10.1016/0167-2789(95)00301-0

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Exact results for deterministic cellular automata traffic models

We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to a well known lattice path counting problem. Assuming infinite lattice size and random initial configuration, the flow can be expressed in terms of generalized hypergeometric function. We show that the steady state limit agrees with previously published results.

comp-gas

A new discrete velocity method for Navier-Stokes equations

The relation between Latttice Boltzmann Method, which has recently become popular, and the Kinetic Schemes, which are routinely used in Computational Fluid Dynamics, is explored. A new discrete velocity model for the numerical solution of the Navier-Stokes equations for incompressible fluid flow is presented by combining both the approaches. The new scheme can be interpreted as a pseudo-compressibility method and, for a particular choice of parameters, this interpretation carries over to the Lattice Boltzmann Method.

comp-gas

Construction of Molecular Dynamics Like Cellular Automata Models for Simulation of Compressible Fluid Dynamic Systems

This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results indicate, the attempt is successful. A systematic method for constructing cellular automata models of fluid dynamic systems is discovered and proposed following a review of the existing developments. The considerations required for constructing such models for fluid dynamic systems consisting of particles with arbitrary interaction potentials and existing over arbitrary spatial lattices are outlined. The method is illustrated by constructing a model for simulation of systems of particles moving with unit speed along the links of an underlying square spatial lattice. Using this model, two two-dimensional systems are simulated and studied for a number of model and system parameters. For almost all the model and system parameters, the results are found to be in complete agreement with the available theoretical predictions. For some model parameters, results show (expected) departure from theoretical predictions which is explained.

comp-gas