Skip to main content

Separation Surfaces through Genetic Programming

  • Conference paper
  • First Online:
Engineering of Intelligent Systems (IEA/AIE 2001)

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 ø; (x)=0, where ø is a function of R n → R. The calculation of function ø 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fisher, R.: The use of multiple measurement in Taxonomic problems. Annals of Eugenics, no 7, pp. 179–188, 1936.

    Google Scholar 

  2. Goldberg, D. E.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, 1989.

    Google Scholar 

  3. Koza, J. R.: Hierarchical genetic algorithms operating on populations of computer programs. Proc. of 11th Int. J. Conf. on A.I., I, pp 768–774, Morgan Kauffman,. 1989.

    Google Scholar 

  4. Koza, J. R.: The genetic programming paradigm: genetically breeding populations of computer programs to solve problems. Dynamic, Genetic and Chaotic Programming, Ed. Baranko Soucek e IRIS Group, pp 269–276. John Wiley & Sons. 1992.

    Google Scholar 

  5. Koza, J. R.: The genetic programming: on the programming of computers by means of natural selection. The MIT Press. 1992.

    Google Scholar 

  6. Koza, J. R.: Genetic Programming II. Automatic discovery of reusable programs. The MIT Press. 1994.

    Google Scholar 

  7. Riquelme, J. y M. Toro: Search and linguistic description of connected regions in quantitative data. Proc. of the IFAC Conference on the Control of Industrial Systems CIS-97, Vol. 3 pp. 310–316, Belfort (France), 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riquelme, J.C., Giráldez, R., Aguilar, J.S., Ruiz, R. (2001). Separation Surfaces through Genetic Programming. In: Monostori, L., Váncza, J., Ali, M. (eds) Engineering of Intelligent Systems. IEA/AIE 2001. Lecture Notes in Computer Science(), vol 2070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45517-5_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-45517-5_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42219-8

  • Online ISBN: 978-3-540-45517-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics