Pruning of Genetic Programming Trees Using Permutation Tests

Created by W.Langdon from gp-bibliography.bib Revision:1.7642

@TechReport{oai:eprints.whiterose.ac.uk:134313,

• title = "Pruning of Genetic Programming Trees Using Permutation Tests",
• author = "Peter Rockett",
• institution = "Department of Electronic and Electrical Engineering, University of Sheffield",
• year = "2018",
• number = "CR2018-1",
• address = "Pitt Street, Sheffield S1 4ET, UK",
• month = "9 " # jul,
• keywords = "genetic algorithms, genetic programming",
• bibsource = "OAI-PMH server at eprints.whiterose.ac.uk",
• format = "text",
• oai = "oai:eprints.whiterose.ac.uk:134313",
• type = "Monograph; NonPeerReviewed",
• URL = "http://eprints.whiterose.ac.uk/134313/1/PruningReport.pdf",
• URL = "http://eprints.whiterose.ac.uk/134313/",
• size = "30 pages",
• abstract = "We present a novel approach based on statistical permutation tests for pruning redundant subtrees from genetic programming (GP) trees. We observe that over a range of regression problems, median tree sizes are reduced by around 20percent largely independent of test function, and that while some large subtrees are removed, the median pruned subtree comprises just three nodes; most take the form of an exact algebraic simplification. Our statistically-based pruning technique has allowed us to explore the hypothesis that a given subtree can be replaced with a constant if this substitution results in no statistical change to the behaviour of the parent tree, what we term approximate simplification. In the eventuality, we infer that 95percent of the pruned subtrees are the result of algebraic simplifications, which provides some practical insight into the scope of removing redundancies in GP trees.",
• notes = "Rockett, P.I. orcid.org/0000-0002-4636-7727",

}

Genetic Programming entries for Peter I Rockett

Citations