Article ID: | iaor20083354 |
Country: | United Kingdom |
Volume: | 6 |
Issue: | 3 |
Start Page Number: | 455 |
End Page Number: | 480 |
Publication Date: | Sep 2007 |
Journal: | Journal of Mathematical Modelling and Algorithms |
Authors: | Affenzeller Michael, Wagner Stefan, Winkler Stephan |
Keywords: | datamining |
A Genetic Programming based approach for solving classification problems is presented in this paper. Classification is understood as the act of placing an object into a set of categories, based on the object's properties; classification algorithms are designed to learn a function which maps a vector of object features into one of several classes. This is done by analyzing a set of input–output examples (‘training samples’) of the function. Here we present a method based on the theory of Genetic Algorithms and Genetic Programming that interprets classification problems as optimization problems: Each presented instance of the classification problem is interpreted as an instance of an optimization problem, and a solution is found by a heuristic optimization algorithm. The major new aspects presented in this paper are advanced algorithmic concepts as well as suitable genetic operators for this problem class (mainly the creation of new hypotheses by merging already existing ones and their detailed evaluation). The experimental part of the paper documents the results produced using new hybrid variants of Genetic Algorithms as well as investigated parameter settings. Graphical analysis is done using a novel multiclass classifier analysis concept based on the theory of Receiver Operating Characteristic curves.