Evolving multiple discretizations with adaptive intervals for a Pittsburgh rule-based learning classifier system

Authors:
Jaume Bacardit;Josep Maria Garrell
Affiliations:
Intelligent Systems Research Group, Enginyeria i Arquitectura La Salle, Universitat Ramon Llull, Barcelona, Catalonia, Spain, Europe;Intelligent Systems Research Group, Enginyeria i Arquitectura La Salle, Universitat Ramon Llull, Barcelona, Catalonia, Spain, Europe
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 10
Cited 10

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Data mining: practical machine learning tools and techniques with Java implementations

Data mining: practical machine learning tools and techniques with Java implementations
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Learning Decision Lists

Machine Learning
Evolution of Multi-adaptive Discretization Intervals for a Rule-Based Genetic Learning System

IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Get Real! XCS with Continuous-Valued Inputs

Learning Classifier Systems, From Foundations to Applications
Chi2: Feature Selection and Discretization of Numeric Attributes

TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Classifier fitness based on accuracy

Evolutionary Computation
Effects of code growth and parsimony pressure on populations in genetic programming

Evolutionary Computation
Learning concept classification rules using genetic algorithms

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2

Feature influence for evolutionary learning

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Wrapper discretization by means of estimation of distribution algorithms

Intelligent Data Analysis
On the appropriateness of evolutionary rule learning algorithms for malware detection

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
AMPSO: a new particle swarm method for nearest neighborhood classification

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Bloat control and generalization pressure using the minimum description length principle for a pittsburgh approach learning classifier system

IWLCS'03-05 Proceedings of the 2003-2005 international conference on Learning classifier systems
Analysis of the Effectiveness of the Genetic Algorithms based on Extraction of Association Rules

Fundamenta Informaticae - Intelligent Data Analysis in Granular Computing
Using computational intelligence to identify performance bottlenecks in a computer system

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Genetics-based machine learning for rule induction: state of the art, taxonomy, and comparative study

IEEE Transactions on Evolutionary Computation
An approach to reduce the cost of evaluation in evolutionary learning

IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
A novel approach for designing adaptive fuzzy classifiers based on the combination of an artificial immune network and a memetic algorithm

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the ways to solve classification problems with real-value attributes using a Learning Classifier System is the use of a discretization algorithm, which enables traditional discrete knowledge representations to solve these problems. A good discretization should balance losing the minimum of information and having a reasonable number of cut points. Choosing a single discretization that achieves this balance across several domains is not easy. This paper proposes a knowledge representation that uses several discretization (both uniform and non-uniform ones) at the same time, choosing the correct method for each problem and attribute through the iterations. Also, the intervals proposed by each discretization can split and merge among them along the evolutionary process, reducing the search space where possible and expanding it where necessary. The knowledge representation is tested across several domains which represent a broad range of possibilities.