A new decoding method of the grammatical evolution
Article No.: 97, Pages 1 - 7
Abstract
GE (grammatical Evolution) is an evolutionary algorithm that evolves programs in an arbitrary language using a variable-length binary string. The binary genome determines which production rules from the grammar definition of the Backs-Naur form(BNF) are used for the program in the genotype-phenotype mapping process. However, the matter relating to the completeness of individual phenotype throughout population formation isn't well self-addressed, so limiting both the convergence speed and the accuracy of the evaluations to some extent. In this paper, we propose an improved GE algorithm that aims to guarantee the completeness of individual phenotypes during initialization as well as subsequent evolution. A comparison of the improved algorithm (IGE) with the classical GE algorithm (CGE) and NGE(integer-coded grammatical evolution) conducted on the symbolic regression problems shows that the improved algorithm (IGE) not only reduces the search space and improves the accuracy of the algorithm, but also speeds up the convergence of the algorithm in constructing both.
Definition 1. “Incomplete”: An individual is called an incomplete individual if its corresponding sentential form contains a non-terminal symbol, and its corresponding mapping process is called incomplete mapping.
Definition 2. "Recursive" production rule: Refers to the BNF in which the same non-terminal symbol appears on the left and right sides of the production rule.
Definition 3. Combined production rule: For a production rule with a non-terminal symbol in the right part, if it can be followed by only one type of production rule, it is said that the production rule and its subsequent followable production rule are combined production rules.
Definition 4. Non-combined production rule: Production rule except for combined production rule
References
[1]
Pétrowski A, Ben-Hamida S. Evolutionary algorithms[M]. John Wiley & Sons, 2017.
[2]
Holland J H. Genetic algorithms[J]. Scientific American, 1992, 267(1): 66-73.
[3]
Koza J R, Poli R. Genetic programming[M]//Search methodologies. Springer, Boston, MA, 2005: 127-164.
[4]
O'Neill M, Ryan C. Grammatical evolution[J]. IEEE Transactions on Evolutionary Computation, 2001, 5(4): 349-358.
[5]
McCracken D D, Reilly E D. Backus-naur form (bnf)[M]//Encyclopedia of Computer Science. 2003: 129-131.
[6]
Ryan C, Collins J J, Neill M O. Grammatical evolution: Evolving programs for an arbitrary language[C]//European conference on genetic programming. Springer, Berlin, Heidelberg, 1998: 83-96.
[7]
Ryan C, O'Neill M. Grammatical evolution: A steady-state approach[J]. Late-Breaking Papers, Genetic Programming, 1998, 1998: 180-185.
[8]
Shaker N, Nicolau M, Yannakakis G N, Evolving levels for super Mario bros using grammatical evolution[C]//2012 IEEE Conference on Computational Intelligence and Games (CIG). IEEE, 2012: 304-311.
[9]
Lourenço N, Pereira F B, Costa E. Unveiling the properties of structured grammatical evolution[J]. Genetic Programming and Evolvable Machines, 2016, 17(3): 251-289.
[10]
Gupta Gupt K K, Raja M A, Murphy A, GELAB–The Cutting Edge of Grammatical Evolution[J]. IEEE Access, 2022.
[11]
O'Neill M, Ryan C, Keijzer M, Crossover in grammatical evolution[J]. Genetic programming and evolvable machines, 2003, 4(1): 67-93.
[12]
Rothlauf F, Oetzel M. On the locality of grammatical evolution[C]//European conference on genetic programming. Springer, Berlin, Heidelberg, 2006: 320-330.
[13]
Ahmadizar F, Soltanian K, Akhlaghian Tab F, Artificial neural network development using a novel combination of grammatical evolution and genetic algorithm[J]. Engineering Applications of Artificial Intelligence, 2015, 39: 1-13.
[14]
Parra D, Gutiérrez A, Velasco J M, Combining the Properties of Random Forest with Grammatical Evolution to Construct Ensemble Models[C]//International Conference on the Applications of Evolutionary Computation (Part of EvoStar). Springer, Cham, 2022: 61-76.
[15]
He P, Johnson C G, Wang H F. Modeling grammatical evolution by automaton[J]. Science China Information Sciences, 2011, 54(12): 2544-2553.
[16]
He P, Deng Z, Wang H, Model approach to grammatical evolution: theory and case study[J]. Soft Computing, 2016, 20(9): 3537-3548.
[17]
He P, Deng Z, Gao C, Model approach to grammatical evolution: deep-structured analyzing of model and representation[J]. Soft Computing, 2017, 21(18): 5413-5423.
[18]
Hugosson J, Hemberg E, Brabazon A, Genotype representations in grammatical evolution[J]. Applied Soft Computing, 2010, 10(1): 36-43.
[19]
A reference book for teaching formal language and automata theory (3rd Ed.). Tsinghua University Press [cited 2022-05-20] (In Chinese)
Index Terms
- A new decoding method of the grammatical evolution
Index terms have been assigned to the content through auto-classification.
Recommendations
Evolvability in grammatical evolution
GECCO '17: Proceedings of the Genetic and Evolutionary Computation ConferenceEvolvability is a measure of the ability of an Evolutionary Algorithm (EA) to improve the fitness of an individual when applying a genetic operator. Other than the specific problem, many aspects of the EA may impact on the evolvability most notably the ...
Probabilistic Grammatical Evolution
Genetic ProgrammingAbstractGrammatical Evolution (GE) is one of the most popular Genetic Programming (GP) variants, and it has been used with success in several problem domains. Since the original proposal, many enhancements have been proposed to GE in order to address some ...
Co-evolutionary probabilistic structured grammatical evolution
GECCO '22: Proceedings of the Genetic and Evolutionary Computation ConferenceThis work proposes an extension to Structured Grammatical Evolution (SGE) called Co-evolutionary Probabilistic Structured Grammatical Evolution (Co-PSGE). In Co-PSGE each individual in the population is composed by a grammar and a genotype, which is a ...
Comments
Information & Contributors
Information
Published In
December 2022
770 pages
ISBN:9781450398336
DOI:10.1145/3579654
Copyright © 2022 ACM.
Publication rights licensed to ACM. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 March 2023
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ACAI 2022
ACAI 2022: 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence
December 23 - 25, 2022
Sanya, China
Acceptance Rates
Overall Acceptance Rate 173 of 395 submissions, 44%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 27Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format