Automatic detection of go-based patterns in CA model of vegetable populations: Experiments on geta pattern recognition

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper presents an empirical study aiming at evaluating and comparing several Machine Learning (ML) classification techniques in the automatic recognition of known patterns. The main motivations of this work is to select best performing classification techniques where target classes are based on the occurrence of known patterns in configurations of a forest system modeled according to Cellular Automata. Best performing ML classifiers will be adopted for the study of ecosystem dynamics within an interdisciplinary research collaboration between computer scientists, biologists and ecosystem managers (Cellular Automata For Forest Ecosystems - CAFFE project). One of the main aims of the CAFFE project is the development of an analysis method based on recognition in CA state configurations of spatial patterns whose interpretations are inspired by the Chinese Go game. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Bandini, S., Manzoni, S., Redaelli, S., & Vanneschi, L. (2006). Automatic detection of go-based patterns in CA model of vegetable populations: Experiments on geta pattern recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4173 LNCS, pp. 427–435). Springer Verlag. https://doi.org/10.1007/11861201_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free