Abstract
This paper presents the fundamental concepts of inductive Genetic Programming, an evolutionary search method especially suitable for inductive learning tasks. We review the components of the method, and propose new approaches to some open issues such as: the sensitivity of the operators to the topology of the genetic program trees, the coordination of the operators, and the investigation of their performance. The genetic operators are examined by correlation and information analysis of the fitness landscapes. The performance of inductive Genetic Programming is studied with population diversity and evolutionary dynamics measures using hard instances for induction of regular expressions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Goldberg, B. Korb and K. Deb,’ Messy Genetic Algorithms: Motivation, Analysis and First Results’, Complex Systems, 3:493–530, 1989.
H. Iba and T. Sato,’ Meta-level Strategy for Genetic Algorithms based on Structured Representations’, In: Proc. Second Pacific Rim Int. Conf. on Artificial Intelligence, pp.548–554, 1992.
H. Iba, H. de Garis and T. Sato,’ Genetic Programming using a Minimum Description Length Principle’, In: Advances in Genetic Programming, K.Kinnear Jr.(ed.), The MIT Press, 265–284, 1994.
T. C. Jones and S. Forrest,’ Fitness Distance Correlation as a Measure of Search Difficulty for Genetic Algorithms’, In: Proc. Sixth Int. Conference on Genetic Algorithms, L.Eshelman (ed.), 184–192, 1995.
M.J. Keith and M.C. Martin,’ Genetic Programming in C++: Implementation Issues’, In: K.E. Kinnear Jr. (ed.), Advances in Genetic Programming, The MIT Press, Cambridge, MA, 285–310, 1994.
J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, The MIT Press, Cambridge, MA, 1992.
S.Y. Lu,’ A Tree-to-Tree Distance and its Application to Cluster Analysis’, IEEE Trans. on Pattern Analysis and Machine Intelligence, 1(1):219–224, 1979.
N. Nikolaev and V. Slavov.’ Inductive Genetic Programming with Decision Trees’, In: M. van Someren and G. Widmer (eds.), Machine Learning: ECML-97, Ninth European Conf. on Machine Learning, LNAI-1224, Springer, Berlin, 183–190, 1997.
P. Nordin and W. Banzhaf,’ Complexity Compression and Evolution’, In: L. Eshelman (ed.), Proc. Sixth Int. Conf. on Genetic Algorithms, ICGA-95, Morgan Kaufmann, CA, 310–317, 1995.
U.-M. O’Reilly, An Analysis of Genetic Programming, PhD Dissertation, Carleton University, Ottawa, Canada, 1995.
J. Rissanen, Stochastic Complexity in Statistical Inquiry. World Scientific Publishing, Singapore, 1989.
V. Slavov and N. Nikolaev,’ Inductive Genetic Programming and the Superposition of the Fitness Landscape’, In: T. BÄck (ed.), Proc. Seventh Int. Conf. on Genetic Algorithms, ICGA-97, Morgan Kaufmann, CA, 97–104, 1997.
P. Stadler,’ Towards a Theory of Landscapes’, In: Complex Systems and Binary Networks, R. Lopéz-Peña et al.(eds.), Springer-Verlag, Berlin, 77–163, 1995.
M. Tomita,’ Dynamic construction of finite-state automata from examples using hill climbing’, In: Proc. Fourth Annual Conf. of the Cognitive Science Society, Ann Arbor, MI, 105–108.
V. Vassilev,’ An Information Measure of Landscapes’, In: T. BÄck (ed.), Proc. Seventh Int. Conf. on Genetic Algorithms, ICGA-97, 49–56, 1997.
B.-T. Zhang and H. Muhlenbein,’ Balancing Accuracy and Parsimony in Genetic Programming’, Evolutionary Computation, 3:1, 17–38, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikolaev, N.I., Slavov, V. (1998). Concepts of inductive genetic programming. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds) Genetic Programming. EuroGP 1998. Lecture Notes in Computer Science, vol 1391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055927
Download citation
DOI: https://doi.org/10.1007/BFb0055927
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64360-9
Online ISBN: 978-3-540-69758-9
eBook Packages: Springer Book Archive