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

被引:0
|
作者
Muhammad Iqbal
Will N. Browne
Mengjie Zhang
机构
[1] Victoria University of Wellington,Evolutionary Computation Research Group, School of Engineering and Computer Science
来源
Soft Computing | 2015年 / 19卷
关键词
Learning classifier systems; XCS; XCSCFA; Genetic algorithms; Evolvability;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:1863 / 1880
页数:17
相关论文
共 6 条
  • [1] Improving genetic search in XCS-based classifier systems through understanding the evolvability of classifier rules
    Iqbal, Muhammad
    Browne, Will N.
    Zhang, Mengjie
    SOFT COMPUTING, 2015, 19 (07) : 1863 - 1880
  • [2] Learning complex, overlapping and niche imbalance Boolean problems using XCS-based classifier systems
    Iqbal, Muhammad
    Browne, Will N.
    Zhang, Mengjie
    EVOLUTIONARY INTELLIGENCE, 2013, 6 (02) : 73 - 91
  • [3] Learning Regular Expressions Using XCS-Based Classifier System
    Rehman, Hafiz Asadul
    Iqbal, Muhammad
    Younas, Irfan
    Bashir, Maryam
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2020, 34 (10)
  • [4] Gradient descent methods in learning classifier systems: Improving XCS performance in multistep problems
    Butz, MV
    Goldberg, DE
    Lanzi, PL
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2005, 9 (05) : 452 - 473
  • [5] An Approach for Automatic Discovery of Rules Based on ECG Data Using Learning Classifier Systems
    Zouri, Muthana
    Ferworn, Alex
    2022 IEEE WORLD AI IOT CONGRESS (AIIOT), 2022, : 145 - 154
  • [6] Improving selection strategies in zeroth-level classifier systems based on average reward reinforcement learning
    Zang Z.
    Li Z.
    Dan Z.
    Wang J.
    Journal of Ambient Intelligence and Humanized Computing, 2024, 15 (02) : 1201 - 1211