Numeric mutation as an improvement to symbolic regression in genetic programming

1998 ◽  
pp. 251-260 ◽  
Author(s):  
Thomas Fernandez ◽  
Matthew Evett
Keyword(s):  
Genetic Programming ◽  
Symbolic Regression

scholarly journals Control Synthesis as Machine Learning Control by Symbolic Regression Methods

2021 ◽  
Vol 11 (12) ◽  
pp. 5468
Author(s):  
Elizaveta Shmalko ◽  
Askhat Diveev
Keyword(s):  
Machine Learning ◽  
Genetic Programming ◽  
Mathematical Formulation ◽  
Small Variation ◽  
Learning Control ◽  
Symbolic Regression ◽  
Control Technique ◽  
Control Synthesis ◽  
Basic Solution ◽  
Regression Methods

The problem of control synthesis is considered as machine learning control. The paper proposes a mathematical formulation of machine learning control, discusses approaches of supervised and unsupervised learning by symbolic regression methods. The principle of small variation of the basic solution is presented to set up the neighbourhood of the search and to increase search efficiency of symbolic regression methods. Different symbolic regression methods such as genetic programming, network operator, Cartesian and binary genetic programming are presented in details. It is shown on the computational example the possibilities of symbolic regression methods as unsupervised machine learning control technique to the solution of MLC problem of control synthesis for obtaining the stabilization system for a mobile robot.

Statistical genetic programming for symbolic regression

2017 ◽  
Vol 60 ◽  
pp. 447-469 ◽  
Author(s):  
Maryam Amir Haeri ◽  
Mohammad Mehdi Ebadzadeh ◽  
Gianluigi Folino
Keyword(s):  
Genetic Programming ◽  
Symbolic Regression

scholarly journals A NEW LINEAR GENETIC PROGRAMMING APPROACH BASED ON STRAIGHT LINE PROGRAMS: SOME THEORETICAL AND EXPERIMENTAL ASPECTS

2009 ◽  
Vol 18 (05) ◽  
pp. 757-781 ◽  
Author(s):  
CÉSAR L. ALONSO ◽  
JOSÉ LUIS MONTAÑA ◽  
JORGE PUENTE ◽  
CRUZ ENRIQUE BORGES
Keyword(s):  
Data Structure ◽  
Genetic Programming ◽  
Computer Programs ◽  
Symbolic Regression ◽  
Programming Approach ◽  
Linear Genetic Programming ◽  
Straight Line ◽  
Structured Representations ◽  
Regression Problems ◽  
Straight Line Programs

Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.

scholarly journals Revisiting the Sequential Symbolic Regression Genetic Programming

2016 ◽  
Author(s):  
Luiz Otavio V.B. Oliveira ◽  
Fernando E.B. Otero ◽  
Luis F. Miranda ◽  
Gisele L. Pappa
Keyword(s):  
Genetic Programming ◽  
Symbolic Regression
Sign in / Sign up

Export Citation Format

Share Document