ACM Home Page
Please provide us with feedback. Feedback
The compact classifier system: motivation, analysis, and first results
Full text PdfPdf (86 KB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 2005 conference on Genetic and evolutionary computation table of contents
Washington DC, USA
POSTER SESSION: Learning classifier systems and other genetics-based machine learning table of contents
Pages: 1993 - 1994  
Year of Publication: 2005
ISBN:1-59593-010-8
Authors
Xavier Llorà  University of Illinois at Urbana-Champaign, Urbana, IL
Kumara Sastry  University of Illinois at Urbana-Champaign, Urbana, IL
David E. Goldberg  University of Illinois at Urbana-Champaign, Urbana, IL
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1068009.1068328
What is a DOI?

ABSTRACT

This paper presents an initial analysis of how maximally general and accurate rules can be evolved in a Pittsburgh-style classifier system. In order to be able to perform such analysis we introduce a simple bare-bones Pittsburgh classifier systems---the compact classifier system (CCS)---based on estimation of distribution algorithms. Using a common rule encoding scheme of Pittsburgh classifier systems, CCS maintains a dynamic set of probability vectors that compactly describe a rule set. The compact genetic algorithm is used to evolve each of the initially perturbed probability vectors which represents the rules. Results show how CCS is able to evolve in a compact, simple, and elegant manner rule sets composed by maximally general and accurate rules.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
K. A. De Jong and W. M. Spears. Learning Concept Classification Rules using Genetic Algorithms. In Proceedings of the Twelfth International Conference on Artificial Intelligence IJCAI-91, volume 2, pages 651--656. Morgan Kaufmann, 1991.
 
2
G. Harik, F. Lobo, and D. E. Goldberg. The compact genetic algorithm. Proceedings of the IEEE International Conference on Evolutionary Computation, pages 523--528, 1998. (Also IlliGAL Report No. 97006).
 
3
 
4
P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms. Kluwer Academic Publishers, Boston, MA, 2002.
 
5
X. Llorà and J. Garrell. Knowledge-Independent Data Mining with Fine-Grained Parallel Evolutionary Algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'2001), pages 461--468. Morgan Kaufmann Publishers, 2001.
 
6
X. Llorà, K. Sastry, and D. E. Goldberg. Binary Rule Encoding Scheme: A Study Using The Compact Classifier System. In International Workshop on Learning Classifier Systems (IWLCS 2005), accepted, 2005.
 
7
S. W. Wilson. Classifier fitness based on accuracy. Evolutionary Computation, 3(2):149--175, 1995.


Collaborative Colleagues:
Xavier Llorà: colleagues
Kumara Sastry: colleagues
David E. Goldberg: colleagues