ACM Home Page
Please provide us with feedback. Feedback
Kernel-based, ellipsoidal conditions in the real-valued XCS classifier system
Full text PdfPdf (1.66 MB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 2005 conference on Genetic and evolutionary computation table of contents
Washington DC, USA
SESSION: Learning classifier systems and other genetics-based machine learning table of contents
Pages: 1835 - 1842  
Year of Publication: 2005
ISBN:1-59593-010-8
Author
Martin V. Butz  University of Würzburg, Würzburg, Germany
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): 5,   Downloads (12 Months): 32,   Citation Count: 16
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.1068320
What is a DOI?

ABSTRACT

Many learning classifier system (LCS) implementations are restricted to the binary problem realm. Recently, the XCS classifier system was enhanced to be able to handle real-valued inputs among others. In the real-valued enhancement, XCSF applies as a function approximation system that partitions the input space in hyperrectangular subspaces specified in the classifiers. This paper changes the classifier conditions to hyperspheres and hyperellipsoids and investigates the consequent performance impact. It is shown that the modifications yield improved performance in continuous functions. Even in discontinuous functions with parallel boundaries, XCS's performance does not degrade. Thus, for the real-valued problem domain, ellipsoidal condition structures can improve XCS's performance. From a more general perspective, this paper shows that XCS is readily applicable in diverse problem domains. To apply the system even more successfully, suitable kernel-based bases need to be found and used as classifier conditions. XCS distributes the available structures over the problem space evolving more specialized structures in more complex problem subspaces.


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
J. Bacardit, D. E. Goldberg, and M. V. Butz. Improving the performance of a Pittsburgh learning classifier system using a default rule, 2004. http://www.psychologie.uni-wuerzburg.de/IWLCS/.
 
2
 
3
 
4
 
5
 
6
 
7
 
8
M. V. Butz, D. E. Goldberg, P. L. Lanzi, and K. Sastry. Bounding the population size to ensure niche support in XCS. IlliGAL report 2004033, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, 2004.
 
9
 
10
M. V. Butz, T. Kovacs, P. L. Lanzi, and S. W. Wilson. How XCS evolves accurate classifiers. Proceedings of the Third Genetic and Evolutionary Computation Conference (GECCO-2001), pages 927--934, 2001.
 
11
M. V. Butz, T. Kovacs, P. L. Lanzi, and S. W. Wilson. Toward a theory of generalization and learning in XCS. IEEE Transactions on Evolutionary Computation, 8:28--46, 2004.
 
12
M. V. Butz and M. Pelikan. Analyzing the evolutionary pressures in XCS. Proceedings of the Third Genetic and Evolutionary Computation Conference (GECCO-2001), pages 935--942, 2001.
 
13
M. V. Butz, K. Sastry, and D. E. Goldberg. Tournament selection in XCS. Proceedings of the Fifth Genetic and Evolutionary Computation Conference (GECCO-2003), pages 1857--1869, 2003.
 
14
 
15
J. H. Holland. Adaptation. In R. Rosen and F. Snell, editors, Progress in theoretical biology, volume 4, pages 263--293. Academic Press, New York, 1976.
 
16
J. H. Holland and J. S. Reitman. Cognitive systems based on adaptive algorithms. In D. A. Waterman and F. Hayes-Roth, editors, Pattern directed inference systems, pages 313--329. Academic Press, New York, 1978.
 
17
P. L. Lanzi. Extending the Representation of Classifier Conditions Part I: From Binary to Messy Coding. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 337--344, 1999.
 
18
P. L. Lanzi. Extending the Representation of Classifier Conditions Part II: From Messy Coding to S-Expressions. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), pages 345--352, 1999.
 
19
 
20
 
21
S. W. Wilson. ZCS: A zeroth level classifier system. Evolutionary Computation, 2:1--18, 1994.
 
22
S. W. Wilson. Classifier fitness based on accuracy. Evolutionary Computation, 3(2):149--175, 1995.
 
23
S. W. Wilson. Generalization in the XCS classifier system. Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 665--674, 1998.
 
24
 
25
S. W. Wilson. Function approximation with a classifier system. Proceedings of the Third Genetic and Evolutionary Computation Conference (GECCO-2001), pages 974--981, 2001.
 
26
 
27

CITED BY  17