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


Poli R.

13th European Conference on Genetic Programming, İstanbul, Türkiye, 7 - 09 Nisan 2010, cilt.6021, ss.208-219 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 6021
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.208-219

Özet

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.