Binary rule encoding schemes: a study using the compact classifier system

  • Authors:

  • Xavier Llorà;Kumara Sastry;David E. Goldberg

  • Affiliations:

  • Illinois Genetic Algorithms Laboratory, National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign, Urbana, IL;Illinois Genetic Algorithms Laboratory, National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign, Urbana, IL;Illinois Genetic Algorithms Laboratory, National Center for Supercomputing Applications, University of Illinois at Urbana-Champaign, Urbana, IL

  • Venue:
  • IWLCS'03-05 Proceedings of the 2003-2005 international conference on Learning classifier systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several binary rule encoding schemes have been proposed for Pittsburgh-style classifier systems. This paper focus on the analysis of how maximally general and accurate rules, regardless of the encoding, can be evolved in a such classifier systems. The theoretical analysis of maximally general and accurate rules using two different binary rule encoding schemes showed some theoretical results with clear implications to the scalability of any genetic-based machine learning system that uses the studied encoding schemes. Such results are clearly relevant since one of the binary representations studied is widely used on Pittsburgh-style classifier systems, and shows an exponential shrink of the useful rules available as the problem size increases . In order to be able to perform such analysis we use a simple barebones Pittsburgh classifier system-- the compact classifier system (CCS)--based on estimation of distribution algorithms.