The subsumption mechanism for XCS using code fragmented conditions

Hsuan Ta Lin, Po Ming Lee, Tzu-Chien Hsiao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

By utilizing a code-fragmented representation of Extended Classifier System (XCS) condition in conjunction with buildingblock extraction technique, autonomous scaling has been realized in the latest work of XCS. The technique substantially reduces the number of training instances required in various benchmark problems. However, the subsumption mechanism was not included in the former report of the technique. Therefore, we invented the subsumption mechanism for XCS with such technique, and observed the characteristics of such the system in multiplexer problems. The finding indicates that our subsumption mechanism decreased the number of macro-classifiers.

Original languageEnglish
Title of host publicationGECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion
Pages1275-1282
Number of pages8
DOIs
StatePublished - 26 Aug 2013
Event15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013 - Amsterdam, Netherlands
Duration: 6 Jul 201310 Jul 2013

Publication series

NameGECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion

Conference

Conference15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013
CountryNetherlands
CityAmsterdam
Period6/07/1310/07/13

Keywords

  • Building blocks
  • Code fragments
  • Extended classifier system (XCS)
  • Pattern recognition
  • Scalability

Fingerprint Dive into the research topics of 'The subsumption mechanism for XCS using code fragmented conditions'. Together they form a unique fingerprint.

Cite this