Discrete Dynamical Genetic Programming in XCS

04/18/2012
by   Richard J. Preen, et al.
0

A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to neural networks. This paper presents results from an investigation into using a discrete dynamical system representation within the XCS Learning Classifier System. In particular, asynchronous random Boolean networks are used to represent the traditional condition-action production system rules. It is shown possible to use self-adaptive, open-ended evolution to design an ensemble of such discrete dynamical systems within XCS to solve a number of well-known test problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2012

Discrete and fuzzy dynamical genetic programming in the XCSF learning classifier system

A number of representation schemes have been presented for use within le...
research
04/18/2012

Fuzzy Dynamical Genetic Programming in XCSF

A number of representation schemes have been presented for use within Le...
research
09/09/2018

Cellular automata as convolutional neural networks

Deep learning techniques have recently demonstrated broad success in pre...
research
08/25/2022

Minimal ℓ^2 Norm Discrete Multiplier Method

We introduce an extension to the Discrete Multiplier Method (DMM), calle...
research
07/19/2023

Deep projection networks for learning time-homogeneous dynamical systems

We consider the general class of time-homogeneous dynamical systems, bot...
research
01/31/2011

Boolean network robotics: a proof of concept

Dynamical systems theory and complexity science provide powerful tools f...
research
06/18/2010

Fractal Basins and Boundaries in 2D Maps inspired in Discrete Population Models

Two-dimensional maps can model interactions between populations. Despite...

Please sign up or login with your details

Forgot password? Click here to reset