ComputingComputer ScienceMathematicsOptimizationSet TheoryTheory Of ComputationApproximation AlgorithmsExistence TheoremsFuzzy LogicCentroid ComputationExistence ConditionsFuzzy ControlFuzzy Inference SystemsFuzzy Rule-based SystemsFuzzy SetsMembership FunctionsStone's Theorem
The author proves that fuzzy systems are universal approximators. The Stone-Weierstrass theorem is used to prove that fuzzy systems with product inference, centroid defuzzification, and a Gaussian membership function are capable of approximating any real continuous function on a compact set to arbitrary accuracy. This result can be viewed as an existence theorem of an optimal fuzzy system for a wide variety of problems.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
24
L. A. Zadeh · Information and Control · 1965 · 66.1K citations
Multilayer feedforward networks are universal approximators
Kurt Hornik, Maxwell B. Stinchcombe, Halbert White · Neural Networks · 1989 · 21.2K citations
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., WhiteH. · Neural Networks · 1989 · 9.4K citations
Principles of mathematical analysis
Carl Hammer · Journal of the Franklin Institute · 1953 · 4.1K citations