基于模糊聚类和矩阵分解的模糊辨识方法

通过改进模糊聚类方法确定模糊模型的前件结构,然后对模糊推理关系矩阵进行QR分解,通过分析秩的亏损来确定聚类规则的有效性,然后采用基于矩阵UD分解最小二乘确定模糊模型的后件参数,实现模糊模型的结构和参数的优化.该方法成功地应用于Box-Jenkins煤气炉数据系统建模.     

基于简约集向量的Takagi–Sugeno模糊模型

利用支持向量学习机制建立模糊模型时, 过多的支持向量将导致复杂的模糊模型. 为此提出了一种基于简约集向量的Takagi-Sugeno模糊模型. 该模型抽取简约集向量产生模糊规则, 规则前件的乘积型多维模糊隶属度函数直接由Mercer核构成, 而规则后件则采用非线性函数. 模型的结构和参数可通过自下而上的简化规则以及不敏感学习进行有效地辨识. 最终得到的模糊模型具有良好的推广能力与精确性, 同时拥有高透明度的模糊规则库. 通过二维sinc函数的逼近及球棍系统的模糊控制的仿真实例, 说明了提出模型的有效性.     

一种模糊逻辑系统的快速学习算法

本文提出了一种模糊逻辑系统的快速学习算法．算法要求预先确定各输入变量上模 糊集合的数目及分布;模糊规则前件可以是任意形状的模糊集合,后件则必须采用单值模糊 集合;模糊推理采用乘积推理;解模糊方法采用Tsukamoto方法．算法由输入－输出数据对 提取模糊规则．模糊规则的后件采用最小二乘方法一次计算得出．本算法对目标对象的逼近 精度取决于输入参数上模糊集合的数目,数目越多,精度越高．算法所需计算量小．     

一种基于量子遗传算法的扩展T-S 模型辨识

在传统T-S模型的基础上,提出一种扩展T-S模型。该模型由一组模糊规则组成,由规则前件实现输入空间的划分,将成员函数及其函数变换引入规则后件以实现对输入子空间的非线性映射。对于该模型的建立,使用改进量子遗传算法优化规则前件,递推最小二乘法确定规则后件参数。通过对两个典型非线性系统辨识,仿真结果表明了该模型可以显著提高辨识精度,且具有很好的泛化性能。     

基于OWA算子的区间值加权模糊推理

针对如何对区间值模糊产生式规则赋予合理权值的问题,将OWA算子引入到区间值模糊推理中。介绍一种基于OWA算子的区间值赋权方法,根据此方法给出区间值模糊集上的加权模糊产生式规则的推理算法。在采用该算法的过程中,为合理地计算输入事实与规则前件的匹配程度,引入基于OWA算子的区间值模糊匹配函数值和总体贴近度的计算方法。实例分析表明了所给出的区间值模糊推理算法的有效性和可行性。     

基于正交最小二乘和UD分解的模糊建模方法

通过改进模糊聚类方法确定模糊模型的前件结构，并对模糊推理关系矩阵进行正交最小二乘估计。通过分析正交向量在模型中贡献的大小确定聚类规则的有效性，然后采用基于UD分解的最小二乘确定模糊模型的后件参数，实现模糊模型的结构和参数的优化。该方法已成功地应用于Box-Jenkins煤气炉的数据系统建模。     

两类模糊推理算法的连续性和逼近性

对Zadeh的模糊推理合成法则(CRI算法)和全蕴涵三I算法(三I算法)是否满足连续性和逼近性问题进行了细致的研究,进一步讨论了这两类算法对逼近误差的传播性能.为此,把模糊推理算法看成是模糊集合到模糊集合的映射,选用海明距离作为两模糊集的距离.证明了在模糊假言推理和模糊拒取式推理情形,这两类算法都拥有连续性.指出三I算法在已知规则的前件和后件是正规集的条件下总是满足逼近性,而CRI算法只有当它满足还原性时才拥有逼近性.在满足逼近性的条件下,两类算法都不会放大逼近误差.结果对构建模糊控制系统和模糊专家系统时选用和分析模糊推理算法有一定的指导作用.     

基于模糊划分和支持向量机的TSK模糊系统

为了提高模糊系统处理高维问题的推广能力与鲁棒性能,提出将模糊聚类和支持向量机算法结合起来构造TSK模糊系统的算法.首先运用模糊聚类算法对输入空间进行划分,确定模糊规则前件的隶属函数.然后用支持向量机算法确定模糊规则的后件参数.该支持向量机的核函数是由模糊规则前件的隶属函数构造的,并且是Mercer核.在3个数据集的实验结果表明,与TSK模糊系统的传统算法和支持向量机相比较,本文算法具有更好的推广能力和鲁棒性.     

基于模糊子空间聚类的0 阶岭回归TSK 模糊系统

经典数据驱动型TSK模糊系统在利用高维数据训练模型时,由于规则前件采用的特征过多,导致规则的解释性和简洁性下降.对此,根据模糊子空间聚类算法的子空间特性,为TSK模型添加特征抽取机制,并进一步利用岭回归实现后件的学习,提出一种基于模糊子空间聚类的0阶岭回归TSK模型构建方法.该方法不仅能为规则抽取出重要子空间特征,而且可为不同规则抽取不同的特征.在模拟和真实数据集上的实验结果验证了所提出方法的优势.     

基于过程输入输出变化关系的模糊建模方法

针对难以建立精确数学模型的复杂过程,提出一种基于过程输入输出数据变化关系的模糊建模方法。首先按过程输出随输入变量变化的程度对输入变量论域进行划分,在此基础上确定模糊模型的规则总数和前件参数;然后根据所建模糊模型可表示为一个前馈模糊神经网络,利用BP学习算法求得过程模糊模型的后件参数。仿真例子验证了模糊建模方法的有效性,同时表明所建模糊规则模型较好的泛化能力。     

A hybrid learning algorithm for a class of interval type-2 fuzzy neural networks

In real life, information about the world is uncertain and imprecise. The cause of this uncertainty is due to: deficiencies on given information, the fuzzy nature of our perception of events and objects, and on the limitations of the models we use to explain the world. The development of new methods for dealing with information with uncertainty is crucial for solving real life problems. In this paper three interval type-2 fuzzy neural network (IT2FNN) architectures are proposed, with hybrid learning algorithm techniques (gradient descent backpropagation and gradient descent with adaptive learning rate backpropagation). At the antecedents layer, a interval type-2 fuzzy neuron (IT2FN) model is used, and in case of the consequents layer an interval type-1 fuzzy neuron model (IT1FN), in order to fuzzify the rule’s antecedents and consequents of an interval type-2 Takagi-Sugeno-Kang fuzzy inference system (IT2-TSK-FIS). IT2-TSK-FIS is integrated in an adaptive neural network, in order to take advantage the best of both models. This provides a high order intuitive mechanism for representing imperfect information by means of use of fuzzy If-Then rules, in addition to handling uncertainty and imprecision. On the other hand, neural networks are highly adaptable, with learning and generalization capabilities. Experimental results are divided in two kinds: in the first one a non-linear identification problem for control systems is simulated, here a comparative analysis of learning architectures IT2FNN and ANFIS is done. For the second kind, a non-linear Mackey-Glass chaotic time series prediction problem with uncertainty sources is studied. Finally, IT2FNN proved to be more efficient mechanism for modeling real-world problems.     

Fuzzy arithmetic-based interpolative reasoning for nonlinear dynamic fuzzy systems

FAIR (fuzzy arithmetic-based interpolative reasoning)—a fuzzy reasoning scheme based on fuzzy arithmetic, is presented here. Linguistic rules of the Mamdani type, with fuzzy numbers as consequents, are used in an inference mechanism similar to that of a Takagi–Sugeno model. The inference result is a weighted sum of fuzzy numbers, calculated by means of the extension principle. Both fuzzy and crisp inputs and outputs can be used, and the chaining of rule bases is supported without increasing the spread of the output fuzzy sets in each step. This provides a setting for modeling dynamic fuzzy systems using fuzzy recursion. The matching in the rule antecedents is done by means of a compatibility measure that can be selected to suit the application at hand. Different compatibility measures can be used for different antecedent variables, and reasoning with sparse rule bases is supported. The application of FAIR to the modeling of a nonlinear dynamic system based on a combination of knowledge-driven and data-driven approaches is presented as an example.     

区间Type-2 T-S间接自适应模糊控制

本文在Type-1 T-S间接自适应模糊控制器的基础上,利用Type-2模糊系统理论,提出了区间Type-2 T-S间接自适应模糊控制器的设计方法.由于该系统的规则前件是区间Type-2模糊集合,后件为精确数,使构造的控制方法既具备Type-2模糊集处理诸多不确定性的特点,能够减少由于规则不确定对系统的影响,同时又具有T-S模糊模型后件为各输入变量的线性组合的特点,可以提高系统的建模精度,减少系统的规则数等优点.本文利用Lyapunov合成方法,研究了在所有变量一致有界的意义下,闭环系统的全局稳定性,分析了区间Type-2 T-S间接自适应模糊控制系统的收敛性,并给出了系统参数的自适应律.通过倒立摆跟踪模型进行仿真,验证其有效性和优越性.     

A reduction approach for fuzzy rule bases of fuzzy controllers

In this paper, a new approach to reducing the number of rules in a given fuzzy rule base of a fuzzy controller is presented. The fuzzy mechanism of the fuzzy controller under consideration consists of the product-sum inference, singleton output consequents and centroid defuzzification. The output consequents in the cells of the rule table are collected and represented as an output consequent matrix. The feature of the output consequent matrix is extracted by the singular values of the matrix. The output consequent matrix is reasonably approximated with a dominant consequent matrix. Also, the elements of the dominant consequent matrix is determined to minimize the approximation error function. Then the size of the dominant consequent matrix (the size of the fuzzy rule base) is reduced through the rule combination approach. The scaling factors for the fuzzy controller with the reduced rule table are adjusted to have the control system satisfy the performance indices. The effectiveness of the proposed approach is shown using simulation and experimental results.     

Bayesian zero-order TSK fuzzy system modeling

Different from the existing TSK fuzzy system modeling methods, a novel zero-order TSK fuzzy modeling method called Bayesian zero-order TSK fuzzy system (B-ZTSK-FS) is proposed from the perspective of Bayesian inference in this paper. The proposed method B-ZTSK-FS constructs zero-order TSK fuzzy system by using the maximum a posteriori (MAP) framework to maximize the corresponding posteriori probability. First, a joint likelihood model about zero-order TSK fuzzy system is defined to derive a new objective function which can assure that both antecedents and consequents of fuzzy rules rather than only their antecedents of the most existing TSK fuzzy systems become interpretable. The defined likelihood model is composed of three aspects: clustering on the training set for antecedents of fuzzy rules, the least squares (LS) error for consequent parameters of fuzzy rules, and a Dirichlet prior distribution for fuzzy cluster memberships which is considered to not only automatically match the “sum-to-one” constraints on fuzzy cluster memberships, but also make the proposed method B-ZTSK-FS scalable for large-scale datasets by appropriately setting the Dirichlet index. This likelihood model indeed indicates that antecedent and consequent parameters of fuzzy rules can be linguistically interpreted and simultaneously optimized by the proposed method B-ZTSK-FS which is based on the MAP framework with the iterative sampling algorithm, which in fact implies that fuzziness and probability can co-jointly work for TSK fuzzy system modeling in a collaborative rather than repulsive way. Finally, experimental results on 28 synthetic and real-world datasets are reported to demonstrate the effectiveness of the proposed method B-ZTSK-FS in the sense of approximation accuracy, interpretability and scalability.     

Knowledge modeling based on interval-valued fuzzy rough set and similarity inference: prediction of welding distortion

Knowledge-based modeling is a trend in complex system modeling technology. To extract the process knowledge from an information system, an approach of knowledge modeling based on interval-valued fuzzy rough set is presented in this paper, in which attribute reduction is a key to obtain the simplified knowledge model. Through defining dependency and inclusion functions, algorithms for attribute reduction and rule extraction are obtained. The approximation inference plays an important role in the development of the fuzzy system. To improve the inference mechanism, we provide a method of similaritybased inference in an interval-valued fuzzy environment. larity based approximate reasoning, an inference result is Combining the conventional compositional rule of inference with simideduced via rule translation, similarity matching, relation modification, and projection operation. This approach is applied to the problem of predicting welding distortion in marine structures, and the experimental results validate the effectiveness of the proposed methods of knowledge modeling and similarity-based inference.     

Reduction of fuzzy rule base via singular value decomposition

Introduces a singular value-based method for reducing a given fuzzy rule set. The method conducts singular value decomposition of the rule consequents and generates certain linear combinations of the original membership functions to form new ones for the reduced set. The present work characterizes membership functions by the conditions of sum normalization (SN), nonnegativeness (NN), and normality (NO). Algorithms to preserve the SN and NN conditions in the new membership functions are presented. Preservation of the NO condition relates to a high-dimensional convex hull problem and is not always feasible in which case a closed-to-NO solution may be sought. The proposed method is applicable regardless of the adopted inference paradigms. With product-sum-gravity inference and singleton support fuzzy rule base, output errors between the full and reduced fuzzy set are bounded by the sum of the discarded singular values. The work discusses three specific applications of fuzzy reduction: fuzzy rule base with singleton support, fuzzy rule base with nonsingleton support (which includes the case of missing rules), and the Takagi-Sugeno-Kang (TSK) model. Numerical examples are presented to illustrate the reduction process     

基于直觉模糊Petri网的加权直觉模糊推理

利用直觉模糊集合较好地表现不确定信息的能力和Petri网的并行处理能力,构建了直觉模糊Petri网模型。给出了输入权值、变迁阈值等多种约束条件下的直觉模糊推理算法。该算法将直觉模糊推理过程转化为矩阵的运算过程可充分利用直觉模糊Petri网的并行推理能力,有效地避免同一变迁不必要地重复激发从而节省推理时间。实例分析表明所给出的直觉模糊推理算法较已有算法更加合理并且高效。     

A Fuzzy Inference Network Model for Search Strategy Using Neural Logic Network

In this paper, a fuzzy inference network model for search strategy using neural logic network is presented. The model describes search strategy, and neural logic network is used to search. Fuzzy logic can bring about appropriate inference results by ignoring some information in the reasoning process. Neural logic networks are powerful tools for the reasoning process but not appropriate for the logical reasoning. To model human knowledge, besides the reasoning process capability, the logical reasoning capability is equally important. Another new neural network called neural logic network is able to do the logical reasoning. Because the fuzzy inference is a fuzzy logical reasoning, we construct a fuzzy inference network model based on the neural logic network, extending the existing rule inference network. And the traditional propagation rule is modified.