Learning cellular automata rules for binary classification problem
- 240 Downloads
This paper proposes a cellular automata-based solution of a binary classification problem. The proposed method is based on a two-dimensional, three-state cellular automaton (CA) with the von Neumann neighborhood. Since the number of possible CA rules (potential CA-based classifiers) is huge, searching efficient rules is conducted with use of a genetic algorithm (GA). Experiments show an excellent performance of discovered rules in solving the classification problem. The best found rules perform better than the heuristic CA rule designed by a human and also better than one of the most widely used statistical method: the k-nearest neighbors algorithm (k-NN). Experiments show that CAs rules can be successfully reused in the process of searching new rules.
KeywordsCellular automata Binary classification problem Genetic algorithm
This research was supported by the grant S/WI/2/2008 from Bialystok University of Technology.
- 2.Breukelaar R, Back T (2004) Evolving transition rules for multi dimensional cellular automata. In: Lecture notes in computer science, vol 3305. Springer, Berlin, pp 182–191 Google Scholar
- 3.Das R, Crutchfield J, Mitchell M (1995) Evolving globally synchronized cellular automata. In: Proceedings of the 6th international conference on genetic algorithms, pp 336–343 Google Scholar
- 5.Gacs P, Kurdyumov G, Levin L (1978) One dimensional uniform arrays that wash out finite islands. Probl Pereda Inf 12:92–98 Google Scholar
- 6.Ishibuchi H, Nozaki K, Yamamoto N (1993) Selecting fuzzy rules by genetic algorithm for classification problems. Fuzzy Sets Syst 2:1119–1124 Google Scholar
- 7.Maji P, Sikdar B, Chaudhuri P (2004) Cellular automata evolution for pattern classification. In: Lecture notes in computer science, vol 3305. Springer, Berlin, pp 660–669 Google Scholar
- 9.Oliveira C Jr., de Oliveira P (2008) An approach to searching for two-dimensional cellular automata for recognition of handwritten digits. In: Lecture notes in artificial intelligence, vol 5317. Springer, Berlin, pp 462–471 Google Scholar
- 11.Piwonska A, Seredynski F (2010) Learning cellular automata rules for pattern reconstruction task. In: Lecture notes in computer science, vol 6457. Springer, Berlin, pp 240–249 Google Scholar
- 12.Povalej P, Lenic M, Kokol P (2004) Improving ensembles with classificational cellular automata. In: Lecture notes in computer science, vol 3305. Springer, Berlin, pp 242–249 Google Scholar