2017
DOI: 10.1109/mci.2017.2708618
|View full text |Cite
|
Sign up to set email alerts
|

Gene Expression Programming: A Survey [Review Article]

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
34
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
4

Relationship

2
8

Authors

Journals

citations
Cited by 131 publications
(34 citation statements)
references
References 106 publications
0
34
0
Order By: Relevance
“…Like other techniques such as genetic algorithms (GA) or genetic programming (GP), GEP operates using the fundamental principles of genetic evolution. Generally, GEP has been applied to five categories of problems: symbolic regression, classification, automatic model design, combinatorial optimization, and real parameter optimization [21]. GEP leverages the strengths of genetic-based algorithms while retaining simple genetic operations and faster convergence than GP approaches in complex optimization problems [22].…”
Section: Previous Workmentioning
confidence: 99%
“…Like other techniques such as genetic algorithms (GA) or genetic programming (GP), GEP operates using the fundamental principles of genetic evolution. Generally, GEP has been applied to five categories of problems: symbolic regression, classification, automatic model design, combinatorial optimization, and real parameter optimization [21]. GEP leverages the strengths of genetic-based algorithms while retaining simple genetic operations and faster convergence than GP approaches in complex optimization problems [22].…”
Section: Previous Workmentioning
confidence: 99%
“…The initial population is constructed by a blind random search of the space defined by the problem. The formula obtained by each individual in a population is composed of a random combination of functions (mathematical operators, such as square and addition) and terminals (variables and constants [40,41]) and these mathematical approximations are actually computer programs with a tree structure. Selection of the structure of an analytical expression is a problem of empirical model building.…”
Section: Metamodel Building By Genetic Programming (Gp)mentioning
confidence: 99%
“…Unlike other population-based algorithms that must be implemented with a given machine learning classifier, GP is capable of completing both feature selection and classification independently owing to its tree structure. By converting the tree structure of GP into a string structure, Gene Expression Programming (GEP) (Zhong et al, 2017), a variant of GP, enjoys the same benefit as GP of independent classification ability with additional power of controlling bloat issue by restricted string length (Ferreira, 2002). With the automatic construction capability, GEP-based methods have emerged to show high effectiveness on symbolic regression (Cheng and Zhong, 2018;Huang et al, 2018;Zhong et al, 2018b), time series prediction (Zuo et al, 2004), knowledge discovery (Zhong et al, 2014), and etc.…”
Section: Introductionmentioning
confidence: 99%