Abstract
This paper demonstrates the ability of Hereditary Repulsion to perform well on a range of diverse problem domains. Furthermore, we show that HR is practically invulnerable to the effects to overfitting and does not suffer a loss of generalisation, even in the late stages of evolution. We trace the source of this high quality performance to a pleasingly simple constraint at the heart of the HR algorithm. We confirm its effectiveness by incorporating the constraint into one of the benchmark systems, observing substantial improvements in the quality of generalisation in the evolved population.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cordón, O., de Moya Anegón, F., Zarco, C.: A new evolutionary algorithm combining simulated annealing and genetic programming for relevance feedback in fuzzy information retrieval systems. Soft. Comput 6(5), 308–319 (2002)
Beasley, D.R.B.D., Martin, R.R.: A sequential niche technique for multimodal function optimization. In: Evoluionary Computation, vol. 1, pp. 101–125 (1993)
Darwen, P., Yao, X.: Speciation as automatic categorical modularization. In: IEEE Transactions on Evolutionary Computation, vol. 1, IEEE Computational Intelligence Society, Los Alamitos (1997)
Edmund, S.G., Burke, K., Hendall, G.: Diversity in genetic programming: An analysis of measures and correlation with fitness. In: IEEE Transactions on Evolutionary Computation, vol. 8, IEEE Computational Intelligence Society, Los Alamitos (2004)
Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimisation. In: Proc. 2nd Int Conf. Genetic Algorithms, pp. 41–49 (1987)
Hornby, G.S.: Alps: the age-layered population structure for reducing the problem of premature convergence. Gecco 2005 (2005)
Hu, J., Goodman, E.D.: The hierarchical fair competition (HFC) model for parallel evolutionary algorithms. In: Fogel, D.B., El-Sharkawi, M.A., Yao, X., Greenwood, G., Iba, H., Marrow, P., Shackleton, M. (eds.) Proceedings of the 2002 Congress on Evolutionary Computation CEC 2002, pp. 49–54. IEEE Press, Los Alamitos (2002)
D. J. S. M. X.-Y. L. R. M., C. J.: Automated detection of nodules in the ct lung images using multi-modal genetic algorithm. In: IEEE Transactions on Evolutionary Computation, vol. 1, IEEE Computational Intelligence Society, Los Alamitos (2003)
McPhee, N., Hopper, N.: Analysis of genetic diversity through population history. In: Gecco, pp. 1112–1120 (1999)
Murphy, G., Ryan, C.: Manipulation of convergence in evolutionary systems. In: Genetic Programming Theory and Practise, Springer, Heidelberg (2007)
Sareni, B., Krahenbuhl, L.: Fitness sharing and niching methods revisited. In: IEEE Transactions on Evolutionary Computation, vol. 2, IEEE Computational Intelligence Society, Los Alamitos (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murphy, G., Ryan, C. (2008). A Simple Powerful Constraint for Genetic Programming. In: O’Neill, M., et al. Genetic Programming. EuroGP 2008. Lecture Notes in Computer Science, vol 4971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78671-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-78671-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78670-2
Online ISBN: 978-3-540-78671-9
eBook Packages: Computer ScienceComputer Science (R0)