Recurrence microstates for machine learning classification
From MaRDI portal
Cites work
- A Mathematical Theory of Communication
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- An introduction to machine learning
- Analytical results in calculating the entropy of recurrence microstates
- Chaos in Dynamical Systems
- Efficient computation of recurrence quantification analysis via microstates
- scientific article; zbMATH DE number 773150 (Why is no real title available?)
- Influence of observational noise on the recurrence quantification analysis
- Information Theory and Statistical Mechanics
- Maximum entropy principle in recurrence plot analysis on stochastic and chaotic systems
- Modeling chaotic systems: dynamical equations vs machine learning approach
- On the three-body problem and the equations of dynamics
- Permutation entropy and its variants for measuring temporal dependence
- Quantifying entropy using recurrence matrix microstates
- Quantifying sudden changes in dynamical systems using symbolic networks
- Recurrence density enhanced complex networks for nonlinear time series analysis
- Recurrence quantification based Liapunov exponents for monitoring divergence in experimental data
- Supervised machine learning: a review of classification techniques
- Topological analysis and synthesis of chaotic time series
Cited in
(1)
This page was built for publication: Recurrence microstates for machine learning classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6592635)
