.png){kind=icon}
Return
A decomposition method for symbolic regression problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2017.10.041.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The purpose of this paper is to improve the efficiency of Genetic Programming (GP) by decomposing a regression problem into several subproblems. An optimization problem is defined to find subproblems of the original problem for which the performance of GP is better than for the original problem. In order to evaluate the proposed decomposition method, the subproblems of several benchmark problems are found by solving the optimization problem. Then, a 2-layer GP system is used to find subproblems' solutions in the first layer and the solution of the original problem in the second layer. The results of this 2-layer GP system show that the proposed decomposition method does not generate trivial subproblems. It generates subproblems that improve the efficiency of GP against when subproblems are not used. (C) 2017 Elsevier B.V. All rights reserved.
Keywords:
Genetic Programming
Symbolic regression
Performance estimation
Decomposition
Optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave no more
no more