A Comparison of Genetic Programming Variants for Data Classification

  • Authors:
  • Jeroen Eggermont;A. E. Eiben;Jano I. van Hemert

  • Affiliations:
  • -;-;-

  • Venue:
  • IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we report the results of a comparative study on different variations of genetic programming applied on binary data classification problems. The first genetic programming variant is weighting data records for calculating the classification error and modifying the weights during the run. Hereby the algorithm is defining its own fitness function in an on-line fashion giving higher weights to 'hard' records. Another novel feature we study is the atomic representation, where `Booleanization' of data is not performed at the root, but at the leafs of the trees and only Boolean functions are used in the trees' body. As a third aspect we look at generational and steady-state models in combination of both features.