Analysis of a Digit Concatenation Approach to Constant Creation
This study examines the utility of employing digit concatenation, as distinct from the traditional expression based approach, for the purpose of evolving constants in Grammatical Evolution. Digit concatenation involves creating constants (either whole or real numbers) by concatenating digits to form a single value. The two methods are compared using three different problems, which are finding a static real constant, finding dynamic real constants, and a quadratic map, which on iteration generates a chaotic time-series. The results indicate that the digit concatenation approach results in a significant improvement in the best fitness obtained across all problems analysed here.
KeywordsGenetic Program Digit Concatenation Grammatical Evolution Cache Algorithm Traditional Expression
Unable to display preview. Download preview PDF.
- 1.Angeline, Peter J. (1996). Two Self-Adaptive Crossover Operators for Genetic Programming. In Peter J. Angeline and K. E. Kinnear, Jr. (Eds.), Advances in Genetic Programming 2, Chapter 5, pp.89–110, MIT Press.Google Scholar
- 2.Castillo, E. and Gutierrez, J. (1998). Nonlinear time series modeling and prediction using functional networks. Extracting information masked by chaos, Physics Letters A, 244:71–84.Google Scholar
- 3.Dempsey, I., O’Neill, M. and Brabazon, T. (2002). Investigations into Market Index Trading Models Using Evolutionary Automatic Programming, In Lecture Notes in Artificial Intelligence, 2464, Proceedings of the 13th Irish Conference in Artificial Intelligence and Cognitive Science, pp. 165–170, edited by M. O’Neill, R. Sutclifie, C. Ryan, M. Eaton and N. Griffth, Berlin: Springer-Verlag.Google Scholar
- 4.Evett, Matthew and Fernandez, Thomas. (1998). Numeric Mutation Improves the Discovery of Numeric Constants in Genetic Programming, Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, pp.66–71, Morgan Kaufmann.Google Scholar
- 6.Koza, J. (1992). Genetic Programming. MIT Press.Google Scholar
- 9.O’Neill, M. (2001). Automatic Programming in an Arbitrary Language: Evolving Programs in Grammatical Evolution. PhD thesis, University of Limerick, 2001.Google Scholar
- 10.O’Neill, M., Ryan, C. (1999). Automatic Generation of Caching Algorithms, In K. Miettinen and M.M. Mäkelä and J. Toivanen (Eds.) Proceedings of EUROGEN99, Jyväskylä, Finland, pp.127–134, University of JyväskyläGoogle Scholar
- 12.Ryan C., Collins J.J., O’Neill M. (1998). Grammatical Evolution: Evolving Programs for an Arbitrary Language. Lecture Notes in Computer Science 1391, Proceedings of the First European Workshop on Genetic Programming, 83–95, Springer-Verlag.Google Scholar
- 14.Spencer, G. (1994). Automatic Generation of Programs for Crawling and Walking. In Kenneth E. Kinnear, Jr. (Ed), Advances in Genetic Programming, Chapter 15, pp. 335–353, MIT Press.Google Scholar