A Compression Based Classification Framework Using Symbolic Dynamics of Chaotic Maps
Parth Naik, Harikrishnan N B

TL;DR
This paper introduces a new classification framework based on symbolic dynamics and data compression using chaotic maps, modeling classes with symbolic sequences and selecting the class with the most efficient symbolic encoding.
Contribution
It presents a novel dynamical systems approach to classification that leverages symbolic dynamics and compression, providing a new perspective beyond traditional machine learning methods.
Findings
Competitive performance on synthetic and real datasets
Effective modeling of classes with symbolic sequences from chaotic maps
Demonstrates the potential of dynamical systems in classification tasks
Abstract
We propose a novel classification framework grounded in symbolic dynamics and data compression using chaotic maps. The core idea is to model each class by generating symbolic sequences from thresholded real-valued training data, which are then evolved through a one-dimensional chaotic map. For each class, we compute the transition probabilities of symbolic patterns (e.g., `00', `01', `10', and `11' for the second return map) and aggregate these statistics to form a class-specific probabilistic model. During testing phase, the test data are thresholded and symbolized, and then encoded using the class-wise symbolic statistics via back iteration, a dynamical reconstruction technique. The predicted label corresponds to the class yielding the shortest compressed representation, signifying the most efficient symbolic encoding under its respective chaotic model. This approach fuses concepts…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
