Abstract
This paper proposes a cellular automata-based solution of a two-dimensional 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 very good 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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bailey, T., Jain, A.: A note on distance-weighted k-nearest neighbor rules. IEEE Transactions on Systems, Man and Cybernetics 8(4), 311–313 (1978)
Das, R., Crutchfield, J., Mitchell, M.: Evolving globally synchronized cellular automata. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 336–243 (1995)
Fawcett, T.: Data mining with cellular automata. ACM SIGKDD Explorations Newsletter 10(1), 32–39 (2008)
Ishibuchi, H., Nozaki, K., Yamamoto, N.: Selecting fuzzy rules by genetic algorithm for classification problems. Fuzzy Systems 2, 1119–1124 (1993)
Maji, P., Sikdar, B.K., Pal Chaudhuri, P.: Cellular Automata Evolution for Pattern Classification. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 660–669. Springer, Heidelberg (2004)
Mitchell, M., Hraber, P., Crutchfield, J.: Revisiting the edge of chaos: Evolving cellular automata to perform computations. Complex Systems 7, 89–130 (1993)
Omohundro, S.: Modelling cellular automata with partial differential equations. Physica 10D 10(1-2), 128–134 (1984)
Povalej, P., Lenič, M., Kokol, P.: Improving Ensembles with Classificational Cellular Automata. In: Gallagher, M., Hogan, J.P., Maire, F. (eds.) IDEAL 2005. LNCS, vol. 3578, pp. 242–249. Springer, Heidelberg (2005)
Wolfram, S.: A New Kind of Science Wolfram Media (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Piwonska, A., Seredynski, F., Szaban, M. (2012). Searching Cellular Automata Rules for Solving Two-Dimensional Binary Classification Problem. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-33350-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33349-1
Online ISBN: 978-3-642-33350-7
eBook Packages: Computer ScienceComputer Science (R0)