Data mining with cellular automata

  • Authors:
  • Tom Fawcett

  • Affiliations:
  • Stanford University, Stanford, CA

  • Venue:
  • ACM SIGKDD Explorations Newsletter
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A cellular automaton is a discrete, dynamical system composed of very simple, uniformly interconnected cells. Cellular automata may be seen as an extreme form of simple, localized, distributed machines. Many researchers are familiar with cellular automata through Conway's Game of Life. Researchers have long been interested in the theoretical aspects of cellular automata. This article explores the use of cellular automata for data mining, specifically for classification tasks. We demonstrate that reasonable generalization behavior can be achieved as an emergent property of these simple automata.