Improving genetic search in XCS-based classifier systems through understanding the evolvability of classifier rules

Learning classifier systems (LCSs), an established evolutionary computation technique, are over 30 years old with much empirical testing and foundations of theoretical understanding. XCS is a well-tested LCS model that generates optimal (i.e., maximally general and accurate) classifier rules in the final solution. Previous work has hypothesized the evolution mechanisms in XCS by identifying the bounds of learning and population requirements. However, no work has shown exactly how an optimum rule is evolved or especially identifies whether the methods within an LCS are being utilized effectively. In this paper, we introduce a method to trace the evolution of classifier rules generated in an XCS-based classifier system. Specifically, we introduce the concept of a family tree, termed parent-tree, for each individual classifier rule generated in the system during training, which describes the whole generational process for that classifier. Experiments are conducted on two sample Boolean problem domains, i.e., multiplexer and count ones problems using two XCS-based systems, i.e., standard XCS and XCS with code-fragment actions. The analysis of parent-trees reveals, for the first time in XCS, that no matter how specific or general the initial classifiers are, all the optimal classifiers are converged through the mechanism ‘be specific then generalize’ near the final stages of evolution. Populations where the initial classifiers were slightly more specific than the known ‘ideal’ specificity in the target solutions evolve faster than either very specific, ideal or more general starting classifier populations. Consequently introducing the ‘flip mutation’ method and reverting the conventional wisdom back to apply rule discovery in the match set has demonstrated benefits in binary classification problems, which has implications in using XCS for knowledge discovery tasks. It is further concluded that XCS does not directly utilize all relevant information or all breeding strategies to evolve the optimum solution, indicating areas for performance and efficiency improvement in XCS-based systems.

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

[2]  A. Wagner Robustness and evolvability: a paradox resolved , 2008, Proceedings of the Royal Society B: Biological Sciences.

[3]  Martin V. Butz,et al.  Rule-Based Evolutionary Online Learning Systems - A Principled Approach to LCS Analysis and Design , 2006, Studies in Fuzziness and Soft Computing.

[4]  Marco Colombetti,et al.  What Is a Learning Classifier System? , 1999, Learning Classifier Systems.

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

[6]  Mengjie Zhang,et al.  XCSR with Computed Continuous Action , 2012, Australasian Conference on Artificial Intelligence.

[7]  Ting Hu,et al.  Robustness and Evolvability of Recombination in Linear Genetic Programming , 2013, EuroGP.

[8]  Riccardo Poli,et al.  A Field Guide to Genetic Programming , 2008 .

[9]  Larry Bull,et al.  Foundations of Learning Classifier Systems , 2005 .

[10]  Larry Bull,et al.  Applications of Learning Classifier Systems , 2004 .

[11]  Peter Ross,et al.  GAVEL—A New Tool for Genetic Algorithm , 2001 .

[12]  Peter Ross,et al.  GAVEL - a new tool for genetic algorithm visualization , 2001, IEEE Trans. Evol. Comput..

[13]  Tim Kovacs,et al.  Foundations of learning classifier systems: An introduction , 2005 .

[14]  Mengjie Zhang,et al.  Learning complex, overlapping and niche imbalance Boolean problems using XCS-based classifier systems , 2013, Evol. Intell..

[15]  Riccardo Poli,et al.  An empirical investigation of how and why neutrality affects evolutionary search , 2006, GECCO '06.

[16]  Cristian Sminchisescu,et al.  Object Recognition by Sequential Figure-Ground Ranking , 2011, International Journal of Computer Vision.

[17]  Pier Luca Lanzi,et al.  An Analysis of Generalization in the XCS Classifier System , 1999, Evolutionary Computation.

[18]  Mengjie Zhang,et al.  Evolving optimum populations with XCS classifier systems , 2012, Soft Computing.

[19]  Martin V. Butz,et al.  An algorithmic description of XCS , 2000, Soft Comput..

[20]  Luigi Barone,et al.  On XCSR for electronic fraud detection , 2012, Evol. Intell..

[21]  Risto Miikkulainen,et al.  Evolving Neural Networks through Augmenting Topologies , 2002, Evolutionary Computation.

[22]  J. K. Kinnear,et al.  Advances in Genetic Programming , 1994 .

[23]  Mengjie Zhang,et al.  A Study of Good Predecessor Programs for Reducing Fitness Evaluation Cost in Genetic Programming , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[24]  Will N. Browne,et al.  Investigating scaling of an abstracted LCS utilising ternary and s-expression alphabets , 2007, GECCO '07.

[25]  Kalyan Veeramachaneni,et al.  Introducing graphical models to analyze genetic programming dynamics , 2013, FOGA XII '13.

[26]  Chrisantha Fernando,et al.  The Evolution of Evolvability in Gene Transcription Networks , 2008, ALIFE.

[27]  Jan Drugowitsch Design and Analysis of Learning Classifier Systems - A Probabilistic Approach , 2008, Studies in Computational Intelligence.

[28]  Mengjie Zhang,et al.  Reusing Building Blocks of Extracted Knowledge to Solve Complex, Large-Scale Boolean Problems , 2014, IEEE Transactions on Evolutionary Computation.

[29]  Hussein A. Abbass,et al.  Intrusion detection with evolutionary learning classifier systems , 2009, Natural Computing.

[30]  Ting Hu,et al.  Evolutionary dynamics on multiple scales: a quantitative analysis of the interplay between genotype, phenotype, and fitness in linear genetic programming , 2012, Genetic Programming and Evolvable Machines.

[31]  L. Altenberg The evolution of evolvability in genetic programming , 1994 .

[32]  Mengjie Zhang,et al.  Parent Selection Pressure Auto-Tuning for Tournament Selection in Genetic Programming , 2013, IEEE Transactions on Evolutionary Computation.

[33]  Jan Drugowitsch Design and Analysis of Learning Classifier Systems: A Probabilistic Approach (Studies in Computational Intelligence) , 2008 .

[34]  Mengjie Zhang,et al.  Extending learning classifier system with cyclic graphs for scalability on complex, large-scale boolean problems , 2013, GECCO '13.