Abstract
We analyze the disruptiveness of four operators in an evolutionary algorithm(EA) solving a grammar induction problem. The EA in question contains mutation, crossover, inversion, and substitution operators. Grammars are encoded on genotypes in a representation which includes variable-length introns. A repeated measures analysis of variance (ANOVA) with four factors, the four operators' rates, is used. It is discovered that crossover and mutation rates interact, meaning that their effects on the EA's performance when used together are more than the sum of their individual effects. This suggests that operators should be studied in combination, instead of in isolation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. L. Bailey and C. Elkan, “Fitting a mixture model by expectation maximization to discover motifs in biopolymers,” Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, pp. 28–36. AAAI Press, Menlo Park, California, 1994.
E. Charniak. Statistical Language Learning. The MIT Press, Cambridge, MA 1993.
B. Dawson-Saunders and R. G. Trapp. Basic and Clinical Biostatistics. Appleton and Lange, Norwalk, Connecticut, second edition 1994.
T. E. Kammeyer and R. K. Belew, “Stochastic Context-free Grammar Induction with a Genetic Algorithm using Local Search,” Foundations of Genetic Algorithms 4. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1996.
R. B. McCall. Fundamental Statistics for Behavioral Sciences. Harcourt Brace Jovanovich, Publishers, San Diego, CA, fourth edition 1986.
M. Schwehm and A. Ost, “Inference of Stochastic Regular Grammars by Massively Parallel Genetic Algorithms,” Proceedings of the Sixth International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1995.
J. A. Rice. Mathematical Statistics and Data Analysis. Brooks/Cole Publishing Co., Monterey, CA, 1988.
P. Wyard, “Context Free Grammar Induction Using Genetic Algorithms,” Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1991.
P. Wyard, “Representational Issues for Context-Free Grammar Induction Using Genetic Algorithms,” technical report, British Telecom, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kammeyer, T.E., Belew, R.K. (1998). An empirical investigation of an evolutionary algorithm's ability to maintain a known good solution. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040827
Download citation
DOI: https://doi.org/10.1007/BFb0040827
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64891-8
Online ISBN: 978-3-540-68515-9
eBook Packages: Springer Book Archive