Phillip Wong
ABSTRACT
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome a GP system, exhausting system resources and causing premature termination of the system before an acceptable solution can be found. Simplification is an attempt to remove such redundancies from programs. This paper looks at the effects of applying an algebraic simplification algorithm to programs during the GP evolution. The GP system with the simplification is examined and compared to a standard GP system on four regression and classification problems of varying difficulty. The results suggest that the GP system employing a simplification component can achieve superior efficiency and effectiveness to the standard system on these problems.
- W. Banzhaf, P. Nordin, R. E. Keller, and F. D. Francone. Genetic Programming: An Introduction on the Automatic Evolution of computer programs and its Applications. Morgan Kaufmann Publishers, 1998.]] Google Scholar
Digital Library
- T. Blickle and L. Thiele. Genetic programming and redundancy. In J. Hopf, editor, Genetic Algorithms within the Framework of Evolutionary Computation, pages 33--38, Germany, 1994.]]Google Scholar
- J. Busch, J. Ziegler, C. Aue, A. Ross, D. Sawitzki, and W. Banzhaf. Automatic generation of control programs for walking robots using genetic programming. In EuroGP '02: Proceedings of the 5th European Conference on Genetic Programming, pages 258--267, London, UK, 2002.]] Google ScholarDigital Library
- B. Cherowitzo, 2006. Lecture Notes. http://www-math.cudenver.edu/wcherowi/courses/m5410/exeucalg.html. Visited on 7 January 2006.]]Google Scholar
- R. Fikes and N. Nilsson. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189--208, 1971.A. Georghiades, P. Belhumeur, and D. Kriegman. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intelligence, 23(6):643--660, 2001.]] Google ScholarDigital Library
- A. Georghiades, P. Belhumeur, and D. Kriegman. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Trans. Pattern Anal. Mach. Intelligence, 23(6):643--660, 2001.]] Google ScholarDigital Library
- G. H. Gonnet. Determining equivalence of expressions in random polynomial time. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, pages 334--341, New York, USA, 1984.]] Google ScholarDigital Library
- J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.]] Google ScholarDigital Library
- J. R. Koza, M. A. Keane, M. J. Streeter, W. Mydlowec, J. Yu, and G. Lanza. Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, 2003.]] Google ScholarDigital Library
- R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, New York, NY, USA, 1986.]] Google ScholarDigital Library
- T. Loveard and V. Ciesielski. Representing classification problems in genetic programming. In Proceedings of the Congress on Evolutionary Computation, volume 2, pages 1070--1077, Seoul, Korea, 2001. IEEE Press.]]Google ScholarCross Ref
- W. A. Martin. Determining the equivalence of algebraic expressions by hash coding. j-J-ACM, 18(4):549--558, Oct 1971.]] Google ScholarDigital Library
- R. Poli. Genetic programming for image analysis. In Proceedings of the First Annual Conference, pages 363--368, Stanford University, CA, USA, 28-31 July 1996. MIT Press.]]Google Scholar
- T. Soule, J. A. Foster, and J. Dickinson. Code growth in genetic programming. In Proceedings of the First Annual Conference, pages 215--223, Stanford University, CA, USA, 28-31 1996. MIT Press.]]Google Scholar
- W. Trappe and L. C. Washington. Introduction to Cryptograpy with Coding theory. Prentice-Hall, 2ed edition, 2006.]] Google ScholarDigital Library
- M. Zhang and V. Ciesielski. Genetic programming for multiple class object detection. In Proceedings of the 12th Australian Joint Conference on Artificial Intelligence, volume 1747 of LNAI, pages 180--192, Sydney, Australia. 1999. Springer-Verlag.]] Google ScholarDigital Library
- M. Zhang and W. Smart. Multiclass object classification using genetic programming. In Applications of Evolutionary Computing, EvoWorkshops2004, volume 3005 of LNCS, pages 369--378, Portugal. 2004. Springer Verlag.]]Google Scholar
Index Terms
- Algebraic simplification of GP programs during evolution
Recommendations
HMXT-GP: an information-theoretic approach to genetic programming that maintains diversity
SAC '11: Proceedings of the 2011 ACM Symposium on Applied ComputingThis paper applies a recent information--theoretic approach to controlling Genetic Algorithms (GAs) called HMXT to tree--based Genetic Programming (GP). HMXT, in a GA domain, requires the setting of selection thresholds in a population and the ...
Bloat-aware GP-based methods with bloat quantification
AbstractGenetic programming (GP) solves optimization problems by simulating the evolution procedure in nature. It has a serious problem termed as bloat, which can cost memory, hamper effective breeding and slow down the evolution process. However, there ...
Genetic programming for medical classification: a program simplification approach
This paper describes a genetic programming (GP) approach to medical data classification problems. In this approach, the evolved genetic programs are simplified online during the evolutionary process using algebraic simplification rules, algebraic ...
Comments