Machine Learning

, Volume 3, Issue 2, pp 193–223

Learning and programming in classifier systems

  • Richard K. Belew
  • Stephanie Forrest
Article

DOI: 10.1007/BF00113897

Cite this article as:
Belew, R.K. & Forrest, S. Mach Learn (1988) 3: 193. doi:10.1007/BF00113897

Abstract

Both symbolic and subsymbolic models contribute important insights to our understanding of intelligent systems. Classifier systems are low-level learning systems that are also capable of supporting representations at the symbolic level. In this paper, we explore in detail the issues surrounding the integration of programmed and learned knowledge in classifier-system representations, including comprehensibility, ease of expression, explanation, predictability, robustness, redundancy, stability, and the use of analogical representations. We also examine how these issues speak to the debate between symbolic and subsymbolic paradigms. We discuss several dimensions for examining the tradeoffs between programmed and learned representations, and we propose an optimization model for constructing hybrid systems that combine positive aspects of each paradigm.

Keywords

Subsymbolicrepresentationinheritancetaggingdefault hierarchyconnectionism
Download to read the full article text

Copyright information

© Kluwer Academic Publishers 1988

Authors and Affiliations

  • Richard K. Belew
    • 1
  • Stephanie Forrest
    • 2
  1. 1.Computer Science and Engineering DepartmentUniversity of CaliforniaLa JollaU.S.A.
  2. 2.Teknowledge, Inc.Palo AltoU.S.A.
  3. 3.Los Alamos National LaboratoryLos Alamos