Dynamical genetic programming in XCSF

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 classifie...

Full description

Saved in:
Bibliographic Details
Published in:Evolutionary computation Vol. 21; no. 3; p. 361
Main Authors: Preen, Richard J, Bull, Larry
Format: Journal Article
Language:English
Published: United States 01.09.2013
Subjects:
Algorithms
Computational Biology - methods
Models, Genetic
Models, Theoretical
Multivariate Analysis
Neural Networks (Computer)
Normal Distribution
Programming Languages
Regression Analysis
Reproducibility of Results
ISSN:1530-9304, 1530-9304
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1530-9304
1530-9304
DOI:10.1162/EVCO_a_00080