Learning cellular automata rules for binary classification problem

Analysis of 90/150 CA Concatenated using Inverse Symmetric Transition Rule

“…The simple structure of CA with logical interconnections is ideally suited for hardware implementation. For these reasons CA have been used for various applications such as pattern classification ( [2], [3]), cryptography ([4] ~ [8]), and pseudorandom-number generation, etc. ( [9] ~ [12]).…”

Probabilistic 2D Cellular Automata Rules for Binary Classification

“…Fawcett designed the heuristic rule based on the von Neumann neighborhood (so-called voting rule) moreover, tested its performance on different data sets. Recently, GA was considered as a tool to select CA rules with von Neumann neighbourhood for binary classification problem by Piwonska et al [6].…”