Easily Adaptable Complexity Measure for Finite Time Series

Details Easily Adaptable Complexity Measure for Finite Time Series Easily Adaptable Complexity Measure for Finite Time Series

2005-05-23

arxiv.org/abs/nlin/0505052v5

Phys. Rev. E 77, 066215 (2008)

Nonlinear Sciences

Chaotic Dynamics

15 page, 3 figures, 1 table; modifications making cruicial points clearer and improve readibility; had been completely rewritt

Scientific paper

We present a complexity measure for any finite time series. This measure has invariance under any monotonic transformation of the time series, has a degree of robustness against noise, and has the adaptability of satisfying almost all the widely accepted but conflicting criteria for complexity measurements. Surprisingly, the measure is developed from Kolmogorov complexity, which is traditionally believed to represent only randomness and to satisfy one criterion to the exclusion of the others. For familiar iterative systems, our treatment may imply a heuristic approach to transforming symbolic dynamics into permutation dynamics and vice versa.

Affiliated with

Also associated with

No associations

Rating

Easily Adaptable Complexity Measure for Finite Time Series does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Easily Adaptable Complexity Measure for Finite Time Series, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Easily Adaptable Complexity Measure for Finite Time Series will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560113