Evolutionary domain covering of an inference system for function approximation (original) (raw)

Abstract

Many interesting and important problems related to the analysis of large numerical data can be formulated as a problem of approximating a function from a set of sample points. Any approximation method should provide minimum error at the given data samples and also should approximate values for other points of the function's domain.

In this paper a method leading to clustering of multidimensional large numerical data is proposed. The method uses a problem-specific evolutionary algorithm which partitions the data space into clusters and forms membership functions of the fuzzy sets involved in the premise parts of the fuzzy rules. The proposed algorithm has a two-stage hierarchial organization. For the first stage, an evolutionary algorithm is used, where an individual in the population represents a cluster of data samples. Three specialized operators are defined to operate on such individuals. During the second stage, a greedy algorithm is used for finding a near-optimum covering.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Anderberg M.R. Cluster Analysis for Applications. Probability and Mathematical Statistics, Academic Press, New York, 1973.
    Google Scholar
  2. Buckley J. J. and Hayashi Y., Numerical relationships between neural networks, continuous functions, and fuzzy systems, Fuzzy Sets and Systems, 60, 1–8, 1993.
    Google Scholar
  3. Cybenko, G. Approximation by superpositions of sigmoidal function. Mathematics of Control, Signals, and Systems, 2, 303–314, 1989.
    Google Scholar
  4. Duran B.S. and Odell P.L. Cluster Analysis — A Survey. Lecture Notes in Economics and Mathematical Systems, Vol. 100, Springer-Verlag, Berlin, 1974.
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Division of Optical and Computer Methods in Mechanics, Institute of Fundamental Technological Research, Polish Academy of Sciences, 00-049, Warsaw, Poland
    Witold Kosiński & Martyna Weigl
  2. Department of Computer Science, University of North Carolina, 28223, Charlotte, NC, USA
    Zbigniew Michalewicz
  3. Institute of Computer Science, Polish Academy of Sciences, 01-237, Warsaw, Poland
    Zbigniew Michalewicz

Authors

  1. Witold Kosiński
  2. Martyna Weigl
  3. Zbigniew Michalewicz

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kosiński, W., Weigl, M., Michalewicz, Z. (1998). Evolutionary domain covering of an inference system for function approximation. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040770

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us