Skip to main content

Automatic Detection of Go–Based Patterns in CA Model of Vegetable Populations: Experiments on Geta Pattern Recognition

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4173))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandini, S., Pavesi, G.: Simulation of vegetable populations dynamics based on cellular automata. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Bandini, S., Manzoni, S., Sand, S., Redaelli, G.M.: Emergent pattern interpretation in vegetable population dynamics. Internal Journal of Unconventional Computing - special issue on selected papers from AUTOMATA 2005 workshop (to appear)

    Google Scholar 

  3. Soletti, G.: Note di Go. FIGG (Federazione Italiana Giuoco Go), available for download at www.figg.org

  4. Mitchell, T.: Machine Learning. McGraw Hill, New York (1996)

    MATH  Google Scholar 

  5. Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley-Interscience, New York (1973)

    MATH  Google Scholar 

  6. McCallum, A., Nigam, K.: A comparison of event models for naive bayes text classification. In: AAAI-98 Workshop on Learning for Text Categorization (1998)

    Google Scholar 

  7. Rish, I.: An empirical study of the naive bayes classifier. In: IJCAI 2001 Workshop on Empirical Methods in Artificial Intelligence (2001)

    Google Scholar 

  8. Rosenblatt, F.: Principle of Neurodynamics. Spartan Books, Washington (1958)

    Google Scholar 

  9. Gallant, S.I.: Perceptron-based learning algorithms. IEEE Transactions on Neural Networks, 179–191 (1990)

    Google Scholar 

  10. Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Networks 5, 359–366 (1989)

    Article  Google Scholar 

  11. Gelman, A., Carlin, J.B., Stern, H.S., Rubin, D.B.: Bayesian Data Analysis. Chapman & Hall/CRC, Boca Raton (1995)

    Google Scholar 

  12. Vapnik, V.: Statistical Learning Theory. Wiley-Interscience, New York (1998)

    MATH  Google Scholar 

  13. Burges, C.J.: A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 2, 121–167 (1998)

    Article  Google Scholar 

  14. Platt, J.C.: Fast training of support vector machines using sequential minimal optimization. In: Advances in Kernel Methods - Support Vector Learning (1998)

    Google Scholar 

  15. Keerthi, S., Shevade, S., Bhattacharyya, C., Murthy, K.: Improvements to Platt’s SMO algorithm for SVM classifier design (1999)

    Google Scholar 

  16. Cleary, J.G., Trigg, E.L.: K*: an instance-based learner using an entropic distance measure. In: Proc. of 12th International Conference on Machine Learning, pp. 108–114. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  17. Quinlan, J.R.: Induction of decision trees. Machine Learning, 81–106 (1986)

    Google Scholar 

  18. Breiman, L., Friedman, J., Olshen, R.A., Stone, C.J.: Classification and regression trees. Wadsworth (1984)

    Google Scholar 

  19. Cutler, A.: Fast classification using perfect random trees. Technical Report 5/99/99, Department of Mathematics and Statistics, Utah State University, USA (1999)

    Google Scholar 

  20. Breiman, L.: Random forests - random features. Technical Report 576, Statistics Department, UC Berkeley, USA (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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: El Yacoubi, S., Chopard, B., Bandini, S. (eds) Cellular Automata. ACRI 2006. Lecture Notes in Computer Science, vol 4173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861201_50

Download citation

  • DOI: https://doi.org/10.1007/11861201_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40929-8

  • Online ISBN: 978-3-540-40932-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics