How XCS deals with rarities in domains with continuous attributes

Authors:
Albert Orriols-Puig;Xavier Llorà;David E. Goldberg
Affiliations:
La Salle - Universitat Ramon Llull, Barcelona, Spain;University of Illinois at Urbana-Champaign, Urbana, IL, USA;University of Illinois at Urbana-Champaign, Urbana, IL, USA
Venue:
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Year:
2010

Citing 8
Cited 1

The Design of Innovation: Lessons from and for Competent Genetic Algorithms

The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Get Real! XCS with Continuous-Valued Inputs

Learning Classifier Systems, From Foundations to Applications
Analysis and improvement of fitness exploitation in XCS: bounding models, tournament selection, and bilateral accuracy

Evolutionary Computation
Mining with rarity: a unifying framework

ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Bounding XCS's parameters for unbalanced datasets

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Classifier fitness based on accuracy

Evolutionary Computation
Handbook of Parametric and Nonparametric Statistical Procedures

Handbook of Parametric and Nonparametric Statistical Procedures
Facetwise analysis of XCS for problems with class imbalances

IEEE Transactions on Evolutionary Computation

Modelling the initialisation stage of the ALKR representation for discrete domains and GABIL encoding

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Michigan-style learning classifier systems solve problems by evolving distributed subsolutions online. Extracting accurate models for subsolutions which are represented by a low number of examples in the training data set has been identified as a key challenge in LCS, and facetwise analysis has been applied to identify the critical elements for success in unbalanced domains. While models for these elements have been developed for XCS with ternary representation, no study has been performed for XCS with interval-based representation, which is most often used in data mining tasks. This paper therefore takes the original design decomposition and adapts it to the interval-based representation. Theory and experimental evidence indicate that XCS with interval-based representation may fail to approximate concepts scarcely represented in the training data set. To overcome this problem, an online covering operator that introduces new specific genetic material in regions where we suspect that there are rarities is designed. The benefits of the online covering operator are empirically analyzed on a collection of artificial and real-world problems.