Developing Postfix-GP Framework for Symbolic Regression Problems

07/07/2015
by   Vipul K. Dabhi, et al.
0

This paper describes Postfix-GP system, postfix notation based Genetic Programming (GP), for solving symbolic regression problems. It presents an object-oriented architecture of Postfix-GP framework. It assists the user in understanding of the implementation details of various components of Postfix-GP. Postfix-GP provides graphical user interface which allows user to configure the experiment, to visualize evolved solutions, to analyze GP run, and to perform out-of-sample predictions. The use of Postfix-GP is demonstrated by solving the benchmark symbolic regression problem. Finally, features of Postfix-GP framework are compared with that of other GP systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/02/2022

Local Optimization Often is Ill-conditioned in Genetic Programming for Symbolic Regression

Gradient-based local optimization has been shown to improve results of g...
research
05/25/2018

Analysing Symbolic Regression Benchmarks under a Meta-Learning Approach

The definition of a concise and effective testbed for Genetic Programmin...
research
10/15/2021

Accelerating Genetic Programming using GPUs

Genetic Programming (GP), an evolutionary learning technique, has multip...
research
04/28/2022

Taylor Genetic Programming for Symbolic Regression

Genetic programming (GP) is a commonly used approach to solve symbolic r...
research
04/14/2023

Analyzing the Interaction Between Down-Sampling and Selection

Genetic programming systems often use large training sets to evaluate th...
research
01/30/2020

SGP-DT: Semantic Genetic Programming Based on Dynamic Targets

Semantic GP is a promising approach that introduces semantic awareness d...
research
05/12/2015

How Far Can You Get By Combining Change Detection Algorithms?

In this paper we investigate how state-of-the-art change detection algor...

Please sign up or login with your details

Forgot password? Click here to reset