A Relaxed Approach to Simplification in Genetic Programming


Johnston M., Liddle T., Zhang M.

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

  • Cilt numarası: 6021
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.110-112

Özet

We propose a novel approach to program simplification in tree-based Genetic Programming, based upon numerical relaxations of algebraic rules. We also separate proposal of simplifications from an acceptance criterion that checks the effect of proposed simplifications on the evaluation of training examples, looking several levels up the tree. We test our simplification method on three classification datasets and conclude that the success of linear regression is dataset dependent, that looking further up the tree can catch ineffective simplifications, and that CPU time can be significantly reduced while maintaining classification accuracy on unseen examples.