Abstract
This paper presents a new grammatical evolution (GE) that generates automatic program under favor of probabilistic context-free grammar. A population of individuals is evolved under genotypic integer strings and a mapping process is utilized to translate from genotype (i.e., integer string) to phenotype (i.e., complete program). To efficiently handle this process, unlike the standard GE that employs a simple modulo function, the probability concept is introduced to context-free grammar, thereby choosing production rules according to assigned probabilities. Moreover, any crossover and mutation are not employed for generating new individuals. Instead, along the lines of estimation of distribution algorithms that perform search using a probabilistic model of superior individuals, a new population is created/evolved from probabilistic relationship between production rules. A comparative study on the standard GE and the proposed GE is conducted; the performance achieved by the both methods is comparable. Also, the experimental results firmly demonstrate the effectiveness of the proposed approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O’Neill, M., Ryan, C.: Grammatical evolution. IEEE Transactions on Evolutionary Computation 5, 349–358 (2001)
Ryan, C., Collins, J.J., Neill, M.O.: Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–96. Springer, Heidelberg (1998)
Fogel, D.B.: Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, 3rd edn. Wiley-IEEE Press (2005)
Goldberg, D.E., Holland, J.H.: Genetic algorithms and machine learning. Machine Learning 3, 95–99 (1988), doi:10.1023/A:1022602019183
Larrañaga, P., Lozano, J.A.: Estimation of distribution algorithms: A new tool for evolutionary computation, vol. 2. Springer (2002)
Paul, T.K., Iba, H.: Linear and combinatorial optimizations by estimation of distribution algorithms. In: 9th MPS Symposium on Evolutionary Computation, IPSJ, Japan (2002)
Lima, C.F., Pelikan, M., Goldberg, D.E., Lobo, F.G., Sastry, K., Hauschild, M.: Influence of selection and replacement strategies on linkage learning in boa. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 1083–1090. IEEE (2007)
Koza, J.R.: Genetic programming II: automatic discovery of reusable programs. MIT Press (1994)
Koza, J.R.: Genetic programming III: Darwinian invention and problem solving, vol. 3. Morgan Kaufmann (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kim, HT., Ahn, C.W. (2015). A New Grammatical Evolution Based on Probabilistic Context-free Grammar. In: Handa, H., Ishibuchi, H., Ong, YS., Tan, KC. (eds) Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems - Volume 2. Proceedings in Adaptation, Learning and Optimization, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-319-13356-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-13356-0_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13355-3
Online ISBN: 978-3-319-13356-0
eBook Packages: EngineeringEngineering (R0)