scholarly journals Self-adaptation of parameters in a learning classifier system ensemble machine

2010 ◽  
Vol 20 (1) ◽  
pp. 157-174 ◽  
Author(s):  
Maciej Troć ◽  
Olgierd Unold
Keyword(s):  
Classifier Systems ◽  
Learning Classifier System ◽  
Classifier System ◽  
System A ◽  
Learning Classifier ◽  
Ensemble Machine Learning ◽  
One Step ◽  
Self Adaptation ◽  
Selection Of ◽  
Self Adaptive

Self-adaptation of parameters in a learning classifier system ensemble machineSelf-adaptation is a key feature of evolutionary algorithms (EAs). Although EAs have been used successfully to solve a wide variety of problems, the performance of this technique depends heavily on the selection of the EA parameters. Moreover, the process of setting such parameters is considered a time-consuming task. Several research works have tried to deal with this problem; however, the construction of algorithms letting the parameters adapt themselves to the problem is a critical and open problem of EAs. This work proposes a novel ensemble machine learning method that is able to learn rules, solve problems in a parallel way and adapt parameters used by its components. A self-adaptive ensemble machine consists of simultaneously working extended classifier systems (XCSs). The proposed ensemble machine may be treated as a meta classifier system. A new self-adaptive XCS-based ensemble machine was compared with two other XCS-based ensembles in relation to one-step binary problems: Multiplexer, One Counts, Hidden Parity, and randomly generated Boolean functions, in a noisy version as well. Results of the experiments have shown the ability of the model to adapt the mutation rate and the tournament size. The results are analyzed in detail.

Is a Learning Classifier System a Type of Neural Network?

1994 ◽  
Vol 2 (1) ◽  
pp. 19-36 ◽  
Author(s):  
Robert E. Smith ◽  
H. Brown Cribbs
Keyword(s):  
The Other ◽  
Adaptive Genetic Algorithm ◽  
Diverse Population ◽  
Distinguishing Characteristic ◽  
Classifier Systems ◽  
Learning Classifier System ◽  
Classifier System ◽  
System A ◽  
Learning Classifier ◽  
The Relationship

This paper suggests a simple analogy between learning classifier systems (LCSs) and neural networks (NNs). By clarifying the relationship between LCSs and NNs, the paper indicates how techniques from one can be utilized in the other. The paper points out that the primary distinguishing characteristic of the LCS is its use of a co-adaptive genetic algorithm (GA), where the end product of evolution is a diverse population of individuals that cooperate to perform useful computation. This stands in contrast to typical GA/NN schemes, where a population of networks is employed to evolve a single, optimized network. To fully illustrate the LCS/NN analogy used in this paper, an LCS-like NN is implemented and tested. The test is constructed to run parallel to a similar GA/NN study that did not employ a co-adaptive GA. The test illustrates the LCS/NN analogy and suggests an interesting new method for applying GAs in NNs. Final comments discuss extensions of this work and suggest how LCS and NN studies can further benefit each other.

SELF-ADAPTIVE LEARNING CLASSIFIER SYSTEM

2010 ◽  
Vol 19 (01) ◽  
pp. 275-296 ◽  
Author(s):  
OLGIERD UNOLD
Keyword(s):  
Mutation Rate ◽  
Adaptive Learning ◽  
Adaptive Mutation ◽  
Learning Classifier System ◽  
Classifier System ◽  
Learning Classifier ◽  
Adaptive Parameters ◽  
Proposed Model ◽  
Fixed Parameter ◽  
Self Adaptive

This article introduces a new kind of self-adaptation in discovery mechanism of learning classifier system XCS. Unlike the previous approaches, which incorporate self-adaptive parameters in the representation of an individual, proposed model evolves competitive population of the reduced XCSs, which are able to adapt both classifiers and genetic parameters. The experimental comparisons of self-adaptive mutation rate XCS and standard XCS interacting with 11-bit, 20-bit, and 37-bit multiplexer environment were provided. It has been shown that adapting the mutation rate can give an equivalent or better performance to known good fixed parameter settings, especially for computationally complex tasks. Moreover, the self-adaptive XCS is able to solve the problem of inappropriate for a standard XCS parameters.

scholarly journals Smart Contact Tracing and Classifier System for Covid-19 Cases

2021 ◽  
Vol 9 (9) ◽  
pp. 1239-1245
Keyword(s):  
Operating System ◽  
Short Range ◽  
Contact Tracing ◽  
Classifier Systems ◽  
Learning Classifier System ◽  
Classifier System ◽  
Incremental Method ◽  
Learning Classifier ◽  
Rule Set ◽  
Tracing Method

The growing shreds of evidence and spread of COVID-19 in recent times have shown that to effortlessly and optimally tackle the rate at which COVID-19 infected individuals affect uninfected individuals has become a pressing challenge. This demands the need for a smart contact tracing method for COVID-19 contact tracing. This paper reviewed and analysed the available contact tracing models, contact tracing applications used by 36 countries, and their underlined classifier systems and techniques being used for COVID-19 contact tracing, machine learning classifier methods and ways in which these classifiers are evaluated. The incremental method was adopted because it results in a step-by-step rule set that continually changes. Three categories of learning classifier systems were also studied and recommended the Smartphone Mobile Bluetooth (BLE) and Michigan learning classifier system because it offers a short-range communication that is available regardless of the operating system and classifies based on set rules quickly and faster.

scholarly journals Is Gradient Descent Update Consistent with Accuracy-Based Learning Classifier System?

2009 ◽  
Vol 13 (6) ◽  
pp. 640-648
Author(s):  
Atsushi Wada ◽  
◽  
Keiki Takadama ◽  
◽  
Keyword(s):  
Adaptive Systems ◽  
Gradient Descent ◽  
Benchmark Problems ◽  
Gradient Term ◽  
Rule Discovery ◽  
Discovery Process ◽  
Classifier Systems ◽  
Learning Classifier System ◽  
Classifier System ◽  
Learning Classifier

Learning Classifier Systems (LCSs) are rule-based adaptive systems that have both Reinforcement Learning (RL) and rule-discovery mechanisms for effective and practical online learning. An analysis of the reinforcement process of XCS, one of the currently mainstream LCSs, is performed from the aspect of RL. Upon comparing XCS's update method with gradient-descent-based parameter update in RL, differences are found in the following elements: (1) residual term, (2) gradient term, and (3) payoff definition. All possible combinations of the variants in each element are implemented and tested on multi-step benchmark problems. This revealed that few specific combinations work effectively with XCS's accuracy-based rule-discovery process, while pure gradient-descent-based update showed the worst performance.

Dynamical Genetic Programming in XCSF

2013 ◽  
Vol 21 (3) ◽  
pp. 361-387 ◽  
Author(s):  
Richard J. Preen ◽  
Larry Bull
Keyword(s):  
Genetic Programming ◽  
Financial Time Series ◽  
Learning Problems ◽  
Classifier Systems ◽  
Learning Classifier System ◽  
Classifier System ◽  
Financial Time ◽  
Learning Classifier ◽  
Temporal Intervals ◽  
Arithmetic Networks

A number of representation schemes have been presented for use within learning classifier systems, ranging from binary encodings to artificial neural networks. This paper presents results from an investigation into using a temporally dynamic symbolic representation within the XCSF learning classifier system. In particular, dynamical arithmetic networks are used to represent the traditional condition-action production system rules to solve continuous-valued reinforcement learning problems and to perform symbolic regression, finding competitive performance with traditional genetic programming on a number of composite polynomial tasks. In addition, the network outputs are later repeatedly sampled at varying temporal intervals to perform multistep-ahead predictions of a financial time series.

A Neural Learning Classifier System with Self-Adaptive Constructivism for Mobile Robot Control

2006 ◽  
Vol 12 (3) ◽  
pp. 353-380 ◽  
Author(s):  
Jacob Hurst ◽  
Larry Bull
Keyword(s):  
Mobile Robot ◽  
Learning Classifier System ◽  
Classifier System ◽  
Learning Classifier ◽  
Neural Learning ◽  
Rule Structure ◽  
Mobile Robot Control ◽  
Self Adaptation ◽  
Rate Controlled ◽  
Rule Complexity

For artificial entities to achieve true autonomy and display complex lifelike behavior, they will need to exploit appropriate adaptable learning algorithms. In this context adaptability implies flexibility guided by the environment at any given time and an open-ended ability to learn appropriate behaviors. This article examines the use of constructivism-inspired mechanisms within a neural learning classifier system architecture that exploits parameter self-adaptation as an approach to realize such behavior. The system uses a rule structure in which each rule is represented by an artificial neural network. It is shown that appropriate internal rule complexity emerges during learning at a rate controlled by the learner and that the structure indicates underlying features of the task. Results are presented in simulated mazes before moving to a mobile robot platform.

Performance and Efficiency of Memetic Pittsburgh Learning Classifier Systems

2009 ◽  
Vol 17 (3) ◽  
pp. 307-342 ◽  
Author(s):  
Jaume Bacardit ◽  
Natalio Krasnogor
Keyword(s):  
Learning Classifier Systems ◽  
Classification Rules ◽  
Classifier Systems ◽  
Learning Classifier System ◽  
Classifier System ◽  
Learning Classifier ◽  
Rule Sets ◽  
Rule Set ◽  
Computational Resources ◽  
Robust To Noise

In this paper we empirically evaluate several local search (LS) mechanisms that heuristically edit classification rules and rule sets to improve their performance. Two kinds of operators are studied, (1) rule-wise operators, which edit individual rules, and (2) a rule set-wise operator, which takes the rules from N parents (N ≥ 2) to generate a new offspring, selecting the minimum subset of candidate rules that obtains maximum training accuracy. Moreover, various ways of integrating these operators within the evolutionary cycle of learning classifier systems are studied. The combinations of LS operators and policies are integrated in a Pittsburgh approach framework that we call MPLCS for memetic Pittsburgh learning classifier system. MPLCS is systematically evaluated using various metrics. Several datasets were employed with the objective of identifying which combination of operators and policies scale well, are robust to noise, generate compact solutions, and use the least amount of computational resources to solve the problems.

Robot Reinforcement Learning Based on LCS-GDM

2013 ◽  
Vol 347-350 ◽  
pp. 416-420
Author(s):  
Yong Bin Ma
Keyword(s):  
Reinforcement Learning ◽  
Learning System ◽  
Learning Ability ◽  
Learning Classifier System ◽  
Learning Space ◽  
Rule Based ◽  
Classifier System ◽  
System A ◽  
Learning Classifier ◽  
Learning Rules

This paper proposed a robot reinforcement learning method based on learning classifier system. A learning Classifier System is a rule-based machine learning system that combines reinforcement learning and genetic algorithms. The reinforcement learning component is responsible for adjusting the strength of rules in the system according to some reward obtained from the environment. The genetic algorithm acts as an innovation discovery component which is responsible for discovering new better learning rules. The advantages of this approach are its rule-based representation, which can be easily reduce learning space, online learning ability, robustness .

Sign in / Sign up

Export Citation Format

Share Document