Symbolic Regression via Genetic Programming

Authors:
Douglas A. Augusto;Helio J. C. Barbosa
Affiliations:
-;-
Venue:
SBRN '00 Proceedings of the VI Brazilian Symposium on Neural Networks (SBRN'00)
Year:
2000

Citing 0
Cited 5

Comparison of tree and graph encodings as function of problem complexity

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Learning noise

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Direct transformation of coordinates for GPS positioning using the techniques of genetic programming and symbolic regression

Engineering Applications of Artificial Intelligence
Discovering approximate expressions of GPS geometric dilution of precision using genetic programming

Advances in Engineering Software
Accelerated parallel genetic programming tree evaluation with OpenCL

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we present an implementation of symbolic regression, which is based on genetic programming (GP). Unfortunately, standard implementations of GP in compiled languages are not usually the most efficient ones. The present approach employs a simple representation for tree-like structures by making use of Read's linear code, leading to more simplicity and better performance when compared with traditional GP implementations. Creation, crossover and mutation of individuals are formalized. An extension allowing for the creation of random coefficients is presented. The efficiency of the proposed implementation was confirmed in computational experiments, which are summarized in this paper.