Hierarchical Classiflcation Problems Demand Efiective Building Block Identiflcation and Processing in LCSs

This paper introduces a class of hierarchically structured classification problems that call for effective building block identification and processing in XCS and learning classifier systems in general.

[1]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[2]  Stewart W. Wilson Generalization in the XCS Classifier System , 1998 .

[3]  D. Goldberg,et al.  Bounding Learning Time in XCS , 2004, GECCO.

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Stewart W. Wilson Classifier Fitness Based on Accuracy , 1995, Evolutionary Computation.

[6]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[7]  G. Harik Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[8]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[9]  T. Kovacs Deletion schemes for classifier systems , 1999 .

[10]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[11]  Martin V. Butz,et al.  Toward a theory of generalization and learning in XCS , 2004, IEEE Transactions on Evolutionary Computation.

[12]  David E. Goldberg,et al.  Let's Get Ready to Rumble: Crossover Versus Mutation Head to Head , 2004, GECCO.

[13]  Martin V. Butz,et al.  Analysis and Improvement of Fitness Exploitation in XCS: Bounding Models, Tournament Selection, and Bilateral Accuracy , 2003, Evolutionary Computation.

[14]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .