Abstract
A common problem in genetic programming search algorithms is the destructive nature of the crossover operator in which the offspring of good parents generally has worse performance than the parents. Designing constructive crossover operators and integrating some local search techniques into the breeding process have been suggested as solutions. In this paper, we proposed the integration of variants of local search techniques in the breeding process, done by allowing parents to produce many off springs and applying a selection procedure to choose high performing off springs. Our approach has removed the randomness of crossover operator. To demonstrate our approach, we designed a Multiclass classifier and tested it on various benchmark datasets. Our method has shown the tremendous improvement over the other state of the art methods.
This is a preview of subscription content, log in via an institution to check access.
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
Koza, J.R.: Genetic Programming — On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming - An Introduction. Morgan Kaufmann, San Mateo (1998)
Blickle, T., Thiele, L.: A Mathematical Analysis of Tournament Selection. In: Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 9–16 (1995)
Nordin, P., Banzhaf, W.: Complexity compression and evolution. In: Eshelman, L. (ed.) Genetic Algorithms: Proceedings of the Sixth International Conference, Pittsburgh, PA, USA, July 15-19, pp. 310–317. Morgan Kaufmann (1995)
Nordin, P., Francone, F., Banzhaf, W.: Explicitly Defined Introns and Destructive Crossover in Genetic Programming. In: Rosca, J.P. (ed.) Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pp. 6–22 (1995)
Tackett, W.A.: Recombination, Selection, and the Genetic Construction of Computer Programs. PhD thesis, University of Southern California, Los Angeles, CA, USA (1994)
Purohit, A., Bhardwaj, A., Tiwari, A., Choudhari, N.S.: Removing Code Bloating in Crossover Operation in Genetic Programming. In: IEEE-International Conference on Recent Trends in Information Technology, ICRTIT 2011, June 3-5 (2011); 978-1-4577-0590-8/11/$26.00 ©2011 IEEE MIT, Anna University, Chennai
Lang, K.J.: Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis of Koza’s. In: Proceedings of the Twelfth International Conference on Machine Learning. Morgan Kaufmann (1995)
Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, Department of Information and Computer Science, Irvine, CA (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html
Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction. On the Automatic Evalution of Computer Programs and Its Application. Morgan Kaufmann, San Mateo (1998)
Rich, E., Knight, K., Nair, S.B.: Artificial Intelligence. Tata Mc-Graw-Hill (2009) ISBN: 0070087709
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhardwaj, A., Tiwari, A. (2013). A Novel Genetic Programming Based Classifier Design Using a New Constructive Crossover Operator with a Local Search Technique. In: Huang, DS., Bevilacqua, V., Figueroa, J.C., Premaratne, P. (eds) Intelligent Computing Theories. ICIC 2013. Lecture Notes in Computer Science, vol 7995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39479-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-39479-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39478-2
Online ISBN: 978-3-642-39479-9
eBook Packages: Computer ScienceComputer Science (R0)