2012 IEEE Congress on Evolutionary Computation 2012
DOI: 10.1109/cec.2012.6256587
|View full text |Cite
|
Sign up to set email alerts
|

Self-configuring genetic programming algorithm with modified uniform crossover

Abstract: For genetic programming algorithms new variants of uniform crossover operators that introduce selective pressure on the recombination stage are proposed. Operators probabilistic rates based approach to GP self-configuration is suggested. Proposed modifications usefulness is demonstrated on benchmark test and real world problems. Genetic programming; uniform crossover; selective pressure recombination; self-configuration; symbolic regression; classification I. U.S. Government work not protected by U.S.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(12 citation statements)
references
References 11 publications
0
9
0
Order By: Relevance
“…For solving the problem of GA setting parameters we use the self-configuring algorithm that was proposed in [17]. The scheme of the self-configuring GA is presented in Figure 1.…”
Section: Self-adaptive Gamentioning
confidence: 99%
See 1 more Smart Citation
“…For solving the problem of GA setting parameters we use the self-configuring algorithm that was proposed in [17]. The scheme of the self-configuring GA is presented in Figure 1.…”
Section: Self-adaptive Gamentioning
confidence: 99%
“…Parameters combination selection at random can be also insufficient as algorithm efficiency on same problem can differ very much for various parameters setting. This problem can be solved with self-configuring GA [17] or coevolutionary GA [19]. Therefore, we propose a use of self-adaptive GA for the feature selection in the field of natural language call routing.…”
Section: Introductionmentioning
confidence: 99%
“…In the proposed GA-based optimization, we use binary encoding, roulette-wheel parent selection, uniform crossover [29][30][31], and one-point mutation. In this study, we fix the maximum number of generations at 500.…”
Section: Hybrid Feature Extractionmentioning
confidence: 99%
“…The applied self-configuration method is based on the idea of encouraging those operators which received the highest total fitness in the current generation [8,9]. This approach has proved its efficiency in the solving of hard real-world optimization problems [10,11] and has been recommended for practical use.…”
Section: Description Of the Optimization Techniquementioning
confidence: 99%