International Journal of Bifurcation and Chaos · 2000 · 48 citations · 15 references
ComputingComputer ScienceMathematicsComplex SystemsInformation TheoryTime Series AnalysisChaos TheoryComputational Time Series AnalysisTime Series ClusteringAlgorithmic Information TheoryChaotic Time Series AnalysisClusteringComplexityComplexity MeasuresPartitioning
In this paper we use the concepts of information theory to analyze the time series obtained from complex systems. The procedure discussed here can be applied to quantify the regularity of chaotic time series, although it might not certify chaos. The main idea is to map the time series into a finite sequence of symbols using an efficient partitioning technique, and quantify the regularity of the resulting sequence by a chosen complexity measure. A proper partitioning technique is essential for any meaningful analysis of the resulting sequence. We have used a clustering technique to partition the time series into a finite sequence and the Lempel–Ziv complexity measure to quantify the regularity of this sequence.
15
Determining Lyapunov exponents from a time series
Alan Wolf, J. B. Swift, Harry L. Swinney et al. · Physica D Nonlinear Phenomena · 1985 · 9.4K citations · Full text
An Algorithm for Vector Quantizer Design
Y. Linde, A. Buzo, Robert M. Gray · IEEE Transactions on Communications · 1980 · 7.2K citations
Testing for nonlinearity in time series: the method of surrogate data
James Theiler, Stephen Eubank, André Longtin et al. · Physica D Nonlinear Phenomena · 1992 · 3.8K citations
On the Complexity of Finite Sequences
A. Lempel, J. Ziv · IEEE Transactions on Information Theory · 1976 · 2.7K citations