Separation surfaces through genetic programming
Abstract:
s#iw0.+w...o/ooss#uw+irs"#iuo/oowi+#++o/oow"---6#w#o/oo##s# Abstract. The aim of this paper is to describe a study for the obtaining, symbolically, of the separation surfaces between clusters of a labelled database. A separation surface is an equation with the form f (x)=0, where f is a function of n. The calculation of function f is begun by the development of the parametric regression by means of the use of the Genetic Programming. The symbolic regression consists in approximating an unknown function's equation, through knowledge of certain points ' coordinates and the value that a function reaches with the same ones. This possibility was propose in [Koza92a] and its advantage in front of the classic statistical regressions is that it is not necessary previously to know the form the function. Once this surface is found, a classifier for the database could be obtained. The technique has been applied to different examples and the results have been very satisfactory.
Citations
| 1782 | Genetic Programming: On the Programming of Computers by Means of Natural Selection Cambridge – Koza - 1992 |
| 1082 | Genetic algorithms in search optimization and machine learning – Goldberg - 1989 |
| 496 | The use of multiple measurements in taxonomic problems – Fisher - 1936 |
| 494 | Genetic Programming II: Automatic Discovery of Reusable Programs – Koza - 1994 |
| 103 | Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems – Koza - 1990 |
| 81 | Hierarchical genetic algorithms operating on populations of computer programs – Koza - 1989 |
| 1 | y M. Toro: Search and linguistic description of connected regions in quantitative data – Riquelme - 1997 |
