We show how the understandability and speed of genetic programming classification algorithms can be improved, without affecting the classification accuracy. By analyzing the decision trees evolved we can remove the unessential parts, called introns, from the discovered decision trees. Since the resulting trees contain only useful information they are smaller and easier to understand. Moreover, by using these pruned decision trees in a fitness cache we can significantly reduce the number of unnecessary fitness calculations. © Springer-Verlag 2004.
CITATION STYLE
Eggermont, J., Kok, J. N., & Kosters, W. A. (2004). Detecting and pruning introns for faster decision tree evolution. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3242, 1071–1080. https://doi.org/10.1007/978-3-540-30217-9_108
Mendeley helps you to discover research relevant for your work.