Skip to main content

Voronoi Diagrams Based Function Identification

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2723))

Abstract

Evolutionary algorithms have been applied to function identification problems with great success. This paper presents an approach in which the individuals represent a partition of the input space in Voronoi regions together with a set of local functions associated to each one of these regions. In this way, the solution corresponds to a combination of local functions over a spatial structure topologically represented by a Voronoi diagram. Experiments show that the evolutionary algorithm can successfully evolve both the partition of the input space and the parameters of the local functions in simple problems.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahmed, M. and De Jong, K.: Function Approximator Design using Genetic Algorithms. Proceedings of the 1997 IEEE Int. Conference on Evolutionary Computation, Indianapolis, IN, pp. 519–523 (1997)

    Google Scholar 

  2. Anton, F., Mioc D. and Gold C.: Line Voronoi Diagram based Interpolation and Application to Digital Terrain Modeling. Proceedings of the 13th Canadian Conference on Computational Geometry, University of Waterloo, (2001)

    Google Scholar 

  3. Back, T. Fogel, D. and Michalewicz, Z.(Eds.): Handbook of Evolutionary Computation. IOP Publishing Ltd and Oxford University Press. (1997)

    Google Scholar 

  4. Boissonnat, J. and Cazals, F.: Smooth Surface Reconstruction via Natural Neighbour Interpolation of Distance Functions. Rapport de recherche de l’INRIA — Sophia Antipolis (2000)

    Google Scholar 

  5. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications. Second Edition. Springer-Verlag. (1998)

    Google Scholar 

  6. Fadda, A. and Schoenauer, M., Evolutionary Chromatographic Law Identification by Recurrent Neural Nets. In J. R. McDonnell and R. G. Reynolds and D. B. Fogel, Eds, Proc. 4th Annual Conference on Evolutionary Programming, pp 219–235. MIT Press, 1995.

    Google Scholar 

  7. Fiesler, E. and Beale R. (Eds.): Handbook of Neural Computation. Institute of Physics Publishing. (1997)

    Google Scholar 

  8. Koza, J.: Genetic Programming: On the Programming of Computers by means of Natural Evolution. MIT Press. (1992)

    Google Scholar 

  9. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition. Springer-Verlag Berlin Heidelberg. (1999)

    Google Scholar 

  10. Schoenauer, M., Jouve, F. and Kallel, L. Identification of Mechanical Inclusions. Dasgupta and Z. Michalewicz Ed. Identification of Mechanical Inclusions. Evolutionary Algorithms in Engineering Applications. (1997)

    Google Scholar 

  11. Wilson, S.: Classifiers that approximate functions. Natural Computing, 1(2–3), 211–234 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Zienkiewicz, O. C. and Taylor R. L.: Finite Element Method: Volume 1, The Basis. Fifth edition. Butterworth-Heinemann.(2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kavka, C., Schoenauer, M. (2003). Voronoi Diagrams Based Function Identification. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_118

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics