Abstract
We have applied a range of data mining techniques to a data base of log file records created from genetic programming runs on twelve different problems. We have looked for unexpected patterns, or golden nuggets in the data. Six were found. The main discoveries were a surprising amount of evaluation of duplicate programs across the twelve problems and one case of pathological behaviour which suggested a review of the genetic programming configuration. For problems with expensive fitness evaluation, the results suggest that there would be considerable speedup by caching evolved programs and fitness values. A data mining analysis performed routinely in a GP application could identify problems early and lead to more effective genetic programming applications.
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
Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)
Collins, T.D.: Visualizing evolutionary computation. In: Advances in evolutionary computing: Theory and applications, pp. 95–116. Springer, New York (2003)
Daida, J.M., Hilss, A.M., Ward, D.J., Long, S.L.: Visualizing tree structures in genetic programming. Genetic Programming and Evolvable Machines 6(1), 79–110 (2005)
Ekart, A., Gustafson, S.: A data structure for improved GP analysis via efficient computation and visualisation of population measures. In: Keijzer, M., O’Reilly, U.-M., Lucas, S.M., Costa, E., Soule, T. (eds.) EuroGP 2004. LNCS, vol. 3003, pp. 35–46. Springer, Heidelberg (2004)
Kinnear Jr., K.E.: Fitness landscapes and difficulty in genetic programming. In: Proceedings of the 1994 IEEE World Conference on Computational Intelligence, vol. 1, Orlando, Florida, USA, pp. 142–147. IEEE Press, Los Alamitos (1994)
Langdon, W.B., Poli, R.: Why ants are hard. In: Koza, J.R., et al. (eds.) Genetic Programming 1998, Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, pp. 193–201. Morgan Kaufmann, San Francisco (1998)
Vanneschi, L., Pirola, Y., Collard, P.: A quantitative study of neutrality in gp boolean landscapes. In: Proceedings of the 8th annual conference on Genetic and evolutionary computation. GECCO ’06, pp. 895–902. ACM Press, New York (2006)
Langdon, W.B., Poli, R.: An analysis of the MAX problem in genetic programming. In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Iba, H., Riolo, R.L. (eds.) Genetic Programming 1997, Proceedings of the Second Annual Conference, Stanford University, CA, USA, pp. 222–230. Morgan Kaufmann, San Francisco (1997)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Sloane, N.J.: Number of Binary Trees of Height n. On-Line Encyclopedia of Integer Sequences. http://www.research.att.com/cgi-bin/access.cgi/as/njas/sequences/eisA.cgi?Anum=A001699 (Accessed 11-Oct-2006)
Aho, A., Sloane, N.: Some doubly exponential sequences. Fib. Quart 11 (1973), http://www.research.att.com/~njas/doc/doubly.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Ciesielski, V., Li, X. (2007). Data Mining of Genetic Programming Run Logs. In: Ebner, M., O’Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds) Genetic Programming. EuroGP 2007. Lecture Notes in Computer Science, vol 4445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71605-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-71605-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71602-0
Online ISBN: 978-3-540-71605-1
eBook Packages: Computer ScienceComputer Science (R0)