布尔型模糊系统逼近的充分条件

为了保证布尔模糊系统逼近定义在紧集上任意实值连续函数的逼近精度．给出一个估计布尔模糊系统的输入变量与输出变量各自需要构造的模糊集个数的公式,讨论如何设计布尔模糊系统．以便实现逼近任给的实值连续函数到需要的逼近精度．最后通过一个例子展示了如何设计布尔模糊系统来逼近所给的连续函数的具体方法．     

Sufficient conditions on uniform approximation of multivariatefunctions by general Takagi-Sugeno fuzzy systems with linear ruleconsequent

We have constructively proved a general class of multi-input single-output Takagi-Sugeno (TS) fuzzy systems to be universal approximators. The systems use any types of continuous fuzzy sets, fuzzy logic AND, fuzzy rules with linear rule consequent and the generalized defuzzifier. We first prove that the TS fuzzy systems can uniformly approximate any multivariate polynomial arbitrarily well, and then prove they can also uniformly approximate any multivariate continuous function arbitrarily well. We have derived a formula for computing the minimal upper bounds on the number of fuzzy sets and fuzzy rules necessary to achieve the prespecified approximation accuracy for any given bivariate function. A numerical example is furnished. Our results provide a solid-theoretical basis for fuzzy system applications, particularly as fuzzy controllers and models     

Necessary conditions on minimal system configuration for general MISO Mamdani fuzzy systems as universal approximators

Recent studies have shown that both Mamdani-type and Takagi-Sugeno-type fuzzy systems are universal approximators in that they can uniformly approximate continuous functions defined on compact domains with arbitrarily high approximation accuracy. In this paper, we investigate necessary conditions for general multiple-input single-output (MISO) Mamdani fuzzy systems as universal approximators with as minimal system configuration as possible. The general MISO fuzzy systems employ almost arbitrary continuous input fuzzy sets, arbitrary singleton output fuzzy sets, arbitrary fuzzy rules, product fuzzy logic AND, and the generalized defuzzifier containing the popular centroid defuzzifier as a special case. Our necessary conditions are developed under the practically sensible assumption that only a finite set of extrema of the multivariate continuous function to be approximated is available. We have first revealed a decomposition property of the general fuzzy systems: A r-input fuzzy system can always be decomposed to the sum of r simpler fuzzy systems where the first system has only one input variable, the second one two input variables, and the last one r input variables. Utilizing this property, we have derived some necessary conditions for the fuzzy systems to be universal approximators with minimal system configuration. The conditions expose the strength as well as limitation of the fuzzy approximation: (1) only a small number of fuzzy rules may be needed to uniformly approximate multivariate continuous functions that have a complicated formulation but a relatively small number of extrema; and (2) the number of fuzzy rules must be large in order to approximate highly oscillatory continuous functions. A numerical example is given to demonstrate our new results.     

On the relationship between fuzzy and Boolean cellular automata

Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification” of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper, we are interested in the relationship between Boolean and fuzzy models and, for the first time, we analytically show the existence of a strong connection between them by focusing on two properties: density conservation and additivity.We begin by showing that the density conservation property, extensively studied in the Boolean domain, is preserved in the fuzzy domain: a Boolean CA is density conserving if and only if the corresponding FCA is sum preserving. A similar result is established for another novel “spatial” density conservation property. Second, we prove an interesting parallel between the additivity of Boolean CA and oscillations of the corresponding fuzzy CA around its fixed point. In fact, we show that a Boolean CA is additive if and only if the behaviour of the corresponding fuzzy CA around its fixed point coincides with the Boolean behaviour. Finally, we give a probabilistic interpretation of our fuzzification which establishes an equivalence between convergent fuzzy CA and the mean field approximation on Boolean CA, an estimation of their asymptotic density.These connections between the Boolean and the fuzzy models are the first formal proofs of a relationship between them.     

General SISO Takagi-Sugeno fuzzy systems with linear ruleconsequent are universal approximators

Takagi-Sugeno (TS) fuzzy systems have been employed as fuzzy controllers and fuzzy models in successfully solving difficult control and modeling problems in practice. Virtually all the TS fuzzy systems use linear rule consequent. At present, there exist no results (qualitative or quantitative) to answer the fundamentally important question that is especially critical to TS fuzzy systems as fuzzy controllers and models, “Are TS fuzzy systems with linear rule consequent universal approximators?” If the answer is yes, then how can they be constructed to achieve prespecified approximation accuracy and what are the sufficient renditions on systems configuration? In this paper, we provide answers to these questions for a general class of single-input single-output (SISO) fuzzy systems that use any type of continuous input fuzzy sets, TS fuzzy rules with linear consequent and a generalized defuzzifier containing the widely used centroid defuzzifier as a special case. We first constructively prove that this general class of SISO TS fuzzy systems can uniformly approximate any polynomial arbitrarily well and then prove, by utilizing the Weierstrass approximation theorem, that the general TS fuzzy systems can uniformly approximate any continuous function with arbitrarily high precision. Furthermore, we have derived a formula as part of sufficient conditions for the fuzzy approximation that can compute the minimal upper bound on the number of input fuzzy sets and rules needed for any given continuous function and prespecified approximation error bound, An illustrative numerical example is provided     

正则模糊神经网络是模糊值函数的泛逼近器

通过分析多元模糊值Bernstein多项式的近似特性，证明了4层前向正则模糊神经网络（FNN）的逼近性能，该类网络构成了模糊值函数的一类泛逼近器，即在欧氏空间的任何紧集上，任意连续模糊值函数能被这类FNN逼近到任意精度，最后通过实例给出了实现这种近似的具体步骤。     

Fuzzy approximation via grid point sampling and singular valuedecomposition

This paper introduces a new approach for fuzzy approximation of continuous function on a compact domain. The approach calls for sampling the function over a set of rectangular grid points and applying singular value decomposition to the sample matrix. The resulting quantities are then tailored to become rule consequences and membership functions via the conditions of sum normalization and non-negativeness. The inference paradigm of product-sum-gravity is apparent from the structure of the decomposition equation. All information are extracted directly from the function samples. The present approach yields a class of equivalent fuzzy approximator to a given function. A tight bounding technique to facilitate normal or close-to-normal membership functions is also formulated. The fuzzy output approximates the given function to within an error which is dependent on the sampling intervals and the singular values discarded from the approximation process. Trade-off between the number of membership functions and the desired approximation accuracy is also discussed.     

Measures of general fuzzy rough sets on a probabilistic space

Fuzzy rough set is a generalization of crisp rough set, which deals with both fuzziness and vagueness in data. The measures of fuzzy rough sets aim to dig its numeral characters in order to analyze data effectively. In this paper we first develop a method to compute the cardinality of fuzzy set on a probabilistic space, and then propose a real number valued function for each approximation operator of the general fuzzy rough sets on a probabilistic space to measure its approximate accuracy. The functions of lower and upper approximation operators are natural generalizations of the belief function and plausibility function in Dempster-Shafer theory of evidence, respectively. By using these functions, accuracy measure, roughness degree, dependency function, entropy and conditional entropy of general fuzzy rough set are proposed, and the relative reduction of fuzzy decision system is also developed by using the dependency function and characterized by the conditional entropy. At last, these measure functions for approximation operators are characterized by axiomatic approaches.     

GENERATING AUTOMATIC FUZZY SYSTEM FROM RELATIONAL DATABASE SYSTEM FOR ESTIMATING NULL VALUES

There are many methods trying to do relational database estimations with a highly estimated accuracy rate by constructing a fuzzy learning algorithm automatically. However, there exists a conflict between the degree of the interpretability and the accuracy of the approximation in a general fuzzy system. Thus, how to make the best compromise between the accuracy of the approximation and the degree of the interpretability is a significant study of the subject. In order to achieve the best compromise, this article attempts to propose a simple fuzzy learning algorithm to get a positive result in the relational database estimation on the real world database system, including partition determination, automatic membership function, and rule generation, and system approximation.     

A Novel Fuzzy System With Dynamic Rule Base

A new fuzzy system containing a dynamic rule base is proposed in this paper. The novelty of the proposed system is in the dynamic nature of its rule base which has a fixed number of rules and allows the fuzzy sets to dynamically change or move with the inputs. The number of the rules in the proposed system can be small, and chosen by the designer. The focus of this article is mainly on the approximation capability of this fuzzy system. The proposed system is capable of approximating any continuous function on an arbitrarily large compact domain. Moreover, it can even approximate any uniformly continuous function on infinite domains. This paper addresses existence conditions, and as well provides constructive sufficient conditions so that the new fuzzy system can approximate any continuous function with bounded partial derivatives. Finally, an example is given to show how the proposed fuzzy system can be effectively used for system modeling and control     

Structure identification in complete rule-based fuzzy systems

The identification of a model is one of the key issues in the field of fuzzy system modeling and function approximation theory. There are numerous approaches to the issue of parameter optimization within a fixed fuzzy system structure but no reliable method to obtain the optimal topology of the fuzzy system from a set of input-output data. This paper presents a reliable method to obtain the structure of a complete rule-based fuzzy system for a specific approximation accuracy of the training data, i.e., it can decide which input variables must be taken into account in the fuzzy system and how many membership functions (MFs) are needed in every selected input variable in order to reach the approximation target with the minimum number of parameters     

Fuzzy system and CMAC network with B-spline membership/basis functions are smooth approximators

Due to their universal approximation, fuzzy system with B-spline membership functions and CMAC neural network with B-spline basis functions have been extensively used in control. In many practical applications, they are desired to approximate not only the assigned smooth function as well as its derivatives. In this paper, by designing a fuzzy system and CMAC neural network with B-spline basis functions, we prove that such a fuzzy system and CMAC can universally approximate a smooth function and its derivatives, i.e, for a given accuracy, we can approximate an arbitrary smooth function by such a fuzzy system and CMAC that not only the function is approximate within this accuracy, but its derivatives are approximated as well. The conclusions here provide solid theoretical foundation for their extensive applications. The authors would like to thank the referees for their invaluable suggestions.     

Hierarchical hybrid fuzzy-neural networks for approximation with mixed input variables

Real-world systems usually involve both continuous and discrete input variables. However, in existing learning algorithms of both neural networks and fuzzy systems, these mixed variables are usually treated as continuous without taking into account the special features of discrete variables. It is inefficient to represent each discrete input variable having only a few fixed values by one input neuron with full connection to the hidden layer. This paper proposes a novel hierarchical hybrid fuzzy neural network to represent systems with mixed input variables. The proposed model consists of two levels: the lower level are fuzzy sub-systems each of which aggregates several discrete input variables into an intermediate variable as its output; the higher level is a neural network whose input variables consist of continuous input variables and intermediate variables. For systems or function approximations with mixed variables, it is shown that the proposed hierarchical hybrid fuzzy neural networks outperform standard neural networks in accuracy with fewer parameters, and both provide greater transparency and preserve the universal approximation property (i.e., they can approximate any function with mixed input variables to any degree of accuracy).     

Fuzzy identification of systems with unsupervised learning

The paper describes a mathematical tool to build a fuzzy model whose membership functions and consequent parameters rely on the estimates of a data set. The proposed method proved to be capable of approximating any real continuous function, also a strongly nonlinear one, on a compact set to arbitrary accuracy. Without resorting to domain experts, the algorithm constructs a model-free, complete function approximation system. Applications to the modeling of several functions among which classical nonlinear ones such as the Rosenbrock and the sine (x, y) functions are reported. The proposed algorithm can find applications in the development of fuzzy logic controllers (FLC).     

非线性布尔网络系统模糊建模与动态性能分析

针对非线性系统难以精确建模与动态性能分析的基本控制问题,基于模糊动态模型把布尔网络系统理论推广到非线性布尔网络系统,建立了模糊动态布尔网络控制系统的模型。引入模糊动态模型,对非线性布尔网络进行模糊建模,分别建立了非线性布尔网络系统的局部模型和全局模型。从系统的局部意义和全局意义上,对系统进行了能控性、能观性、稳定性等动态性能分析。最后,以多输入多输出的非线性布尔网络系统实例为具体研究对象,建立了系统的局部模型和全局模型,并对动态性能进行了仿真分析,得到了实验结果。实验结果表明,模糊动态布尔网络控制系统对非线性布尔网络系统的建模是有效的,动态性能分析是合理的,对模糊动态布尔网络控制系统的进一步分析有重要意义。     

广义Mamdani模糊系统依K-积分模的泛逼近及其实现过程

首先,通过引入拟减法算子给出K-积分模定义,并针对广义Mamdani模糊系统实施等距剖分其输入空间. 其次,应用分片线性函数（Piecewise linear function,PLF）的性质构造性地证明了广义Mamdani模糊系统在K-积分模意义下具有泛逼近性,从而将该模糊系统对连续函数空间的逼近能力扩展到一类可积函数类空间上. 最后,通过模拟实例给出该广义Mamdani模糊系统对给定可积函数的泛逼近及实现过程.     

Approximation Capabilities of Hierarchical Fuzzy Systems

Derived from practical application in location analysis and pricing, and based on the approach of hierarchical structure analysis of continuous functions, this paper investigates the approximation capabilities of hierarchical fuzzy systems. By first introducing the concept of the natural hierarchical structure, it is proved that continuous functions with natural hierarchical structure can be naturally and effectively approximated by hierarchical fuzzy systems to overcome the curse of dimensionality in both the number of rules and parameters. Then, based on Kolmogorov's theorem, it is shown that any continuous function can be represented as a superposition of functions with the natural hierarchical structure and can then be approximated by hierarchical fuzzy systems to achieve the universal approximation property. Further, the conditions under which the hierarchical fuzzy approximation is superior to the standard fuzzy approximation in overcoming the curse of dimensionality are analyzed     

Extracting rules from trained neural networks

Presents an algorithm for extracting rules from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural network whose output function is monotone such as a sigmoid function. Therefore, the algorithm can be applied to multilayer neural networks, recurrent neural networks and so on. It does not depend on training algorithms, and its computational complexity is polynomial. The basic idea is that the units of neural networks are approximated by Boolean functions. But the computational complexity of the approximation is exponential, and so a polynomial algorithm is presented. The author has applied the algorithm to several problems to extract understandable and accurate rules. The paper shows the results for the votes data, mushroom data, and others. The algorithm is extended to the continuous domain, where extracted rules are continuous Boolean functions. Roughly speaking, the representation by continuous Boolean functions means the representation using conjunction, disjunction, direct proportion, and reverse proportion. This paper shows the results for iris data.     

Fuzzy systems are universal approximators for a smooth function and its derivatives

One of the reasons why fuzzy methodology is successful is that fuzzy systems are universal approximators, i.e., we can approximate an arbitrary continuous function within any given accuracy by a fuzzy system. In some practical applications (e.g., in control), it is desirable to approximate not only the original function, but also its derivatives (so that, e.g., a fuzzy control approximating a smooth control will also be smooth). In our paper, we show that for any given accuracy, we can approximate an arbitrary smooth function by a fuzzy system so that not only the function is approximated within this accuracy, but its derivatives are approximated as well. In other words, we prove that fuzzy systems are universal approximators for smooth functions and their derivatives. ©2000 John Wiley & Sons, Inc.     

Self-organized fuzzy system generation from training examples

In the synthesis of a fuzzy system two steps are generally employed: the identification of a structure and the optimization of the parameters defining it. The paper presents a methodology to automatically perform these two steps in conjunction using a three-phase approach to construct a fuzzy system from numerical data. Phase 1 outlines the membership functions and system rules for a specific structure, starting from a very simple initial topology. Phase 2 decides a new and more suitable topology with the information received from the previous step; it determines for which variable the number of fuzzy sets used to discretize the domain must be increased and where these new fuzzy sets should be located. This, in turn, decides in a dynamic way in which part of the input space the number of fuzzy rules should be increased. Phase 3 selects from the different structures obtained to construct a fuzzy system the one providing the best compromise between the accuracy of the approximation and the complexity of the rule set. The accuracy and complexity of the fuzzy system derived by the proposed self-organized fuzzy rule generation procedure (SOFRG) are studied for the problem of function approximation. Simulation results are compared with other methodologies such as artificial neural networks, neuro-fuzzy systems, and genetic algorithms