Solution-Locked Averages and Solution-Time Binning in Genetic Programming

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

@InProceedings{Poli:2010:EuroGP,

• author = "Riccardo Poli",
• title = "Solution-Locked Averages and Solution-Time Binning in Genetic Programming",
• booktitle = "Proceedings of the 13th European Conference on Genetic Programming, EuroGP 2010",
• year = "2010",
• editor = "Anna Isabel Esparcia-Alcazar and Aniko Ekart and Sara Silva and Stephen Dignum and A. Sima Uyar",
• volume = "6021",
• series = "LNCS",
• pages = "208--219",
• address = "Istanbul",
• month = "7-9 " # apr,
• organisation = "EvoStar",
• publisher = "Springer",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-3-642-12147-0",
• DOI = "doi:10.1007/978-3-642-12148-7_18",
• size = "12 pages",
• abstract = "Averaging data collected in multiple independent runs across generations is the standard method to study the behaviour of GP. We show that while averaging may represent with good resolution GP's behaviour in the early stages of a run, it blurs later components of the dynamics. We propose two techniques to improve the situation: solution-locked averaging and solution-time binning. Results indicate that there are significant benefits in adopting these techniques.",
• notes = "Part of \cite{Esparcia-Alcazar:2010:GP} EuroGP'2010 held in conjunction with EvoCOP2010 EvoBIO2010 and EvoApplications2010",

}

Genetic Programming entries for Riccardo Poli

Citations