Discriminating chaotic and stochastic time series using permutation entropy and artificial neural networks

• Published in: Scientific reports Vol. 11; no. 1; p. 15789
• Main Authors: Boaretto, B. R. R., Budzinski, R. C., Rossi, K. L., Prado, T. L., Lopes, S. R., Masoller, C.
• Format: Journal Article
• Language: English
• Published: London Nature Publishing Group UK 04-08-2021; Nature Publishing Group; Nature Portfolio
• Subjects: 639/766/259; 639/766/530; 639/766/530/2803; Entropy; Humanities and Social Sciences; multidisciplinary; Neural networks; Noise; Noise levels; Science; Science (multidisciplinary); Stochasticity; Time series
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/s41598-021-95231-z

Extracting relevant properties of empirical signals generated by nonlinear, stochastic, and high-dimensional systems is a challenge of complex systems research. Open questions are how to differentiate chaotic signals from stochastic ones, and how to quantify nonlinear and/or high-order temporal correlations. Here we propose a new technique to reliably address both problems. Our approach follows two steps: first, we train an artificial neural network (ANN) with flicker (colored) noise to predict the value of the parameter,
α
, that determines the strength of the correlation of the noise. To predict
α
the ANN input features are a set of probabilities that are extracted from the time series by using symbolic ordinal analysis. Then, we input to the trained ANN the probabilities extracted from the time series of interest, and analyze the ANN output. We find that the
α
value returned by the ANN is informative of the temporal correlations present in the time series. To distinguish between stochastic and chaotic signals, we exploit the fact that the difference between the permutation entropy (PE) of a given time series and the PE of flicker noise with the same
α
parameter is small when the time series is stochastic, but it is large when the time series is chaotic. We validate our technique by analysing synthetic and empirical time series whose nature is well established. We also demonstrate the robustness of our approach with respect to the length of the time series and to the level of noise. We expect that our algorithm, which is freely available, will be very useful to the community.