Representing Classification Problems in Genetic Programming

@inproceedings{Loveard2001RepresentingCP,
  title={Representing Classification Problems in Genetic Programming},
  author={Thomas Loveard and Victor Ciesielski},
  year={2001}
}
In this paper five alternative methods are proposed to perform multi-class classification tasks using genetic programming. These methods are: Binary decomposition, in which the problem is decomposed into a set of binary problems and standard genetic programming methods are applied; Static range selection, where the set of real values returned by a genetic program is divided into class boundaries using arbitrarily chosen division points; Dynamic range selection in which a subset of training… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 263 citations. REVIEW CITATIONS

10 Figures & Tables

Topics

Statistics

0102030'03'05'07'09'11'13'15'17
Citations per Year

263 Citations

Semantic Scholar estimates that this publication has 263 citations based on the available data.

See our FAQ for additional information.