- author = "Jeannie Fitzgerald and R. Muhammad Atif Azad and Conor Ryan",
- title = "Bootstrapping to reduce bloat and improve generalisation in genetic programming",
- booktitle = "GECCO '13 Companion: Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation conference companion",
- year = "2013",
- editor = "Christian Blum and Enrique Alba and Thomas Bartz-Beielstein and Daniele Loiacono and Francisco Luna and Joern Mehnen and Gabriela Ochoa and Mike Preuss and Emilia Tantar and Leonardo Vanneschi and Kent McClymont and Ed Keedwell and Emma Hart and Kevin Sim and Steven Gustafson and Ekaterina Vladislavleva and Anne Auger and Bernd Bischl and Dimo Brockhoff and Nikolaus Hansen and Olaf Mersmann and Petr Posik and Heike Trautmann and Muhammad Iqbal and Kamran Shafi and Ryan Urbanowicz and Stefan Wagner and Michael Affenzeller and David Walker and Richard Everson and Jonathan Fieldsend and Forrest Stonedahl and William Rand and Stephen L. Smith and Stefano Cagnoni and Robert M. Patton and Gisele L. Pappa and John Woodward and Jerry Swan and Krzysztof Krawiec and Alexandru-Adrian Tantar and Peter A. N. Bosman and Miguel Vega-Rodriguez and Jose M. Chaves-Gonzalez and David L. Gonzalez-Alvarez and Sergio Santander-Jimenez and Lee Spector and Maarten Keijzer and Kenneth Holladay and Tea Tusar and Boris Naujoks",
- isbn13 = "978-1-4503-1964-5",
- keywords = "genetic algorithms, genetic programming",
- pages = "141--142",
- month = "6-10 " # jul,
- organisation = "SIGEVO",
- address = "Amsterdam, The Netherlands",
-
DOI = "
doi:10.1145/2464576.2464647",
- publisher = "ACM",
- publisher_address = "New York, NY, USA",
-
abstract = "Typically, the quality of a solution in Genetic
Programming (GP) is represented by a score on a given
training sample. However, in Machine Learning, we are
most interested in estimating the quality of the
evolving individuals on unseen data. In this paper, we
propose to simulate the effect of unseen data to direct
training without actually using additional data, by
employing a technique called bootstrapping that
repeatedly re-samples with replacement from the
training data and helps estimate sensitivity of the
individual in question to small variations across these
re-sampled data sets. We minimise this sensitivity, as
measured by the Bootstrap Standard Error, alongside the
training error, in a bid to evolve models that
generalise better to the unseen data.
We evaluate the proposed technique on four binary classification problems and compare with a standard GP approach. The results show that for the problems undertaken, the proposed method not only generalises significantly better than standard GP while the training performance improves, but also demonstrates a strong side effect of containing the tree sizes.",
- notes = "Also known as \cite{2464647} Distributed at GECCO-2013.",
