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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Evolutionary computation Ročník 21; číslo 3; s. 361
Hlavní autoři: Preen, Richard J, Bull, Larry
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States 01.09.2013
Témata:
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
On-line přístup:Zjistit podrobnosti o přístupu
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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