Classifier systems and genetic algorithms
Booker, L. B. | Goldberg, D. E. | Holland, J. H.
ABSTRACT Classifier systems are massively parallel, message-passing, rule-based systems that learn through credit assignment (the bucket brigade algorithm) and rule discovery (the genetic algorithm). They typically operate in environments that exhibit one or more of the following characteristics: (1) perpetually novel events accompanied by large amounts of noisy or irrelevant data; (2) continual, often real-time, requirements for action; (3) implicitly or inexactly defined goals; and (4) sparse payoff or reinforcement obtainable only through long action sequences. Classifier systems are designed to absorb new information continuously from such environments, devising sets of compet- ing hypotheses (expressed as rules) without disturbing significantly capabilities already acquired. This paper reviews the definition, theory, and extant applications of classifier systems, comparing them with other machine learning techniques, and closing with a discussion of advantages, problems, and possible extensions of classifier systems. Artificial Intelligence, 40 (1-3), 235-82.
Feb-1-1989
- Country:
- North America > United States
- Massachusetts > Middlesex County (0.14)
- Michigan > Washtenaw County
- Ann Arbor (0.15)
- North America > United States
- Genre:
- Overview (1.00)
- Research Report (0.68)
- Workflow (0.67)
- Industry:
- Leisure & Entertainment > Games > Chess (0.50)
- Technology:
- Information Technology > Artificial Intelligence
- Cognitive Science > Problem Solving (1.00)
- Machine Learning (1.00)
- Representation & Reasoning
- Expert Systems (1.00)
- Rule-Based Reasoning (1.00)
- Search (0.93)
- Information Technology > Artificial Intelligence