Skip to content
Open access

A continuous ordinal patterns-based paradigm for the analysis and comparison of time series.

Aug 2026 · Chaos · Vol 36 8 · 0 citations · 51 references
Medicine

Abstract

We here introduce a method to compare time series, leveraging continuous ordinal patterns, i.e., a variant of the classical order pattern analysis, and inspired by a next-generation reservoir computing architecture. The former ones are used as the non-linear transformation units in the latter, in place of traditional neural elements; as a final step, the transformed time series are classified using a standard machine learning model. This allows one to calculate the distance between a time series and a reference, e.g., a randomly shuffled or time-reversed version of the same, and hence to test properties such as stochasticity or time irreversibility. The method is validated through synthetic data generated by classical chaotic systems, demonstrating higher sensitivity when compared to classical tests, and through data representing real-world systems, spanning financial, medical, and technological ones. We finally discuss some additional relevant topics, including the generalizability of the obtained results and the sensitivity of the method to the chosen parameters.

Read PDF

Similar papers

Open access Sep 2026

Lie-derivative organizers of ordinal-pattern regimes in chaotic systems.

Classical ordinal-pattern methods quantify complexity from a scalar time series without requiring a model, but they are usually reported as global statistics and say little about where along a chaotic trajectory ordinal regimes change. For a smooth flow x˙=F(x) observed through a scalar ϕ(x), we define the first two ma...

M. Sanchis-Agudo · 0 citations
Preprint Aug 2026

Symbolic Neural ODEs: Learning interpretable models from time-series data

Multi-step training of sparse, interpretable models of dynamical systems directly from time-series data yields models with accurate short-term dynamics and strong agreement in long-time statistical properties, including mean, variance, and Lyapunov exponents.

N. Boddupalli, J. Moehlis · 0 citations
Open access Sep 2026

LONG-RANGE DEPENDENCE IN LEXICAL RENEWAL SERIES

This work proposes a numerical series to describe the long-range structure of written texts: each word is mapped to one of four frequency classes, and the number of times the class changes from one position to the next is counted in successive blocks along the text. Classical Detrended Fluctuation Analysis (DFA) and it...

R. N. Vargas, R. Linhares · 0 citations
#machine learning Preprint Sep 2026

Context-dependent time-series prediction via HyperReservoirs

It is found that the HyperReservoir achieves the lowest mean test error in all three tasks, and particularly outperforms conceptors on data that is sampled from the same attractor but at different time scales, and particularly outperforms conceptors on data that is sampled from the same attractor but at different time...

K. Tsuchiyama, Takatomo Mihana, R. Horisaki et al. · 0 citations
#artificial intelligence Preprint Sep 2026

TimeES: Probabilistic and Deterministic Time Series Forecasting via Evolutionary Spectra

Real-world time series are inherently non-stationary, with trends, periodic patterns, and uncertainty evolving over time. While the Fourier domain offers a natural lens to model time series, current deep learning approaches do not explicitly model evolution and randomness in the Fourier spectra, which limits their abil...

Wei-Wei Ye, Ren-He Jiang, Hang-Chen Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.