Type-2 Fuzzy Logic: Circumventing the Defuzzification Bottleneck

Type-2 fuzzy inferencing for generalised, discretised type-2 fuzzy sets has been impeded by the computational complexity of the defuzzification stage of the fuzzy inferencing system. Indeed this stage is so complex computationally that it has come to be known as the defuzzification bottleneck. The computational complexity derives from the enormous number of embedded sets that have to be individually processed in order to effect defuzzification. Two new approaches to type-2 defuzzification are presented, the sampling method and the Greenfield-Chiclana Collapsing Defuzzifier. The sampling method and its variant, elite sampling, are techniques for the defuzzification of generalised type-2 fuzzy sets. In these methods a relatively small sample of the totality of embedded sets is randomly selected and processed. The small sample size drastically reduces the computational complexity of the defuzzification process, so that it may be speedily accomplished. The Greenfield-Chiclana Collapsing Defuzzifier relies upon the concept of the representative embedded set, which is an embedded set having the same defuzzified value as the type-2 fuzzy set that is to be defuzzified. By a process termed collapsing the type-2 fuzzy set is converted into a type-1 fuzzy set which, as an approximation to the representative embedded set, is known as the representative embedded set approximation. This type-1 fuzzy set is easily defuzzified to give the defuzzified value of the original type-2 fuzzy set. By this method the computational complexity of type-2 defuzzification is reduced enormously, since the representative embedded set approximation replaces the entire collection of embedded sets. The strategy was conceived as a generalised method, but so far only the interval version has been derived mathematically. The grid method of discretisation for type-2 fuzzy sets is also introduced in this thesis. Work on the defuzzification of type-2 fuzzy sets began around the turn of the millennium. Since that time a number of investigators have contributed methods in this area. These different approaches are surveyed, and the major methods implemented in code prior to their experimental evaluation. In these comparative experiments the grid method of defuzzification is employed. The experimental results show beyond doubt that the collapsing method performs the best of the interval alternatives. However, though the sampling method performs well experimentally, the results do not demonstrate it to be the best performing generalised technique

Fuzzy Logic in Decision Support: Methods, Applications and Future Trends

During the last decades, the art and science of fuzzy logic have witnessed significant developments and have found applications in many active areas, such as pattern recognition, classification, control systems, etc. A lot of research has demonstrated the ability of fuzzy logic in dealing with vague and uncertain linguistic information. For the purpose of representing human perception, fuzzy logic has been employed as an effective tool in intelligent decision making. Due to the emergence of various studies on fuzzy logic-based decision-making methods, it is necessary to make a comprehensive overview of published papers in this field and their applications. This paper covers a wide range of both theoretical and practical applications of fuzzy logic in decision making. It has been grouped into five parts: to explain the role of fuzzy logic in decision making, we first present some basic ideas underlying different types of fuzzy logic and the structure of the fuzzy logic system. Then, we make a review of evaluation methods, prediction methods, decision support algorithms, group decision-making methods based on fuzzy logic. Applications of these methods are further reviewed. Finally, some challenges and future trends are given from different perspectives. This paper illustrates that the combination of fuzzy logic and decision making method has an extensive research prospect. It can help researchers to identify the frontiers of fuzzy logic in the field of decision making

A Comprehensive Study of the Efficiency of Type-Reduction Algorithms

Improving the efficiency of type-reduction algorithms continues to attract research interest. Recently, there have been some new type-reduction approaches claiming that they are more efficient than the well-known algorithms such as the enhanced Karnik-Mendel (EKM) and the enhanced iterative algorithm with stopping condition (EIASC). In a previous paper, we found that the computational efficiency of an algorithm is closely related to the platform, and how it is implemented. In computer science, the dependence on languages is usually avoided by focusing on the complexity of algorithms (using big O notation). In this paper, the main contribution is the proposal of two novel type-reduction algorithms. Also, for the first time, a comprehensive study on both existing and new type-reduction approaches is made based on both algorithm complexity and practical computational time under a variety of programming languages. Based on the results, suggestions are given for the preferred algorithms in different scenarios depending on implementation platform and application context

A Self-Adaptive Online Brain Machine Interface of a Humanoid Robot through a General Type-2 Fuzzy Inference System

This paper presents a self-adaptive general type-2 fuzzy inference system (GT2 FIS) for online motor imagery (MI) decoding to build a brain-machine interface (BMI) and navigate a bi-pedal humanoid robot in a real experiment, using EEG brain recordings only. GT2 FISs are applied to BMI for the first time in this study. We also account for several constraints commonly associated with BMI in real practice: 1) maximum number of electroencephalography (EEG) channels is limited and fixed, 2) no possibility of performing repeated user training sessions, and 3) desirable use of unsupervised and low complexity features extraction methods. The novel learning method presented in this paper consists of a self-adaptive GT2 FIS that can both incrementally update its parameters and evolve (a.k.a. self-adapt) its structure via creation, fusion and scaling of the fuzzy system rules in an online BMI experiment with a real robot. The structure identification is based on an online GT2 Gath-Geva algorithm where every MI decoding class can be represented by multiple fuzzy rules (models). The effectiveness of the proposed method is demonstrated in a detailed BMI experiment where 15 untrained users were able to accurately interface with a humanoid robot, in a single thirty-minute experiment, using signals from six EEG electrodes only

A support vector-based interval type-2 fuzzy system

In this paper, a new fuzzy regression model that is supported by support vector regression is presented. Type-2 fuzzy systems are able to tackle applications that have significant uncertainty. However general type-2 fuzzy systems are more complex than type-1 fuzzy systems. Support vector machines are similar to fuzzy systems in that they can also model systems that are non-linear in nature. In the proposed model the consequent parameters of type-2 fuzzy rules are learnt using support vector regression and an efficient closed-form type reduction strategy is used to simplify the computations. Support vector regression improved the generalisation performance of the fuzzy rule-based system in which the fuzzy rules were a set of interpretable IF-THEN rules. The performance of the proposed model was demonstrated by conducting case studies for the non-linear system approximation and prediction of chaotic time series. The model yielded promising results and the simulation results are compared to the results published in the area

A support vector-based interval type-2 fuzzy system

In this paper, a new fuzzy regression model that is supported by support vector regression is presented. Type-2 fuzzy systems are able to tackle applications that have significant uncertainty. However general type-2 fuzzy systems are more complex than type-1 fuzzy systems. Support vector machines are similar to fuzzy systems in that they can also model systems that are non-linear in nature. In the proposed model the consequent parameters of type-2 fuzzy rules are learnt using support vector regression and an efficient closed-form type reduction strategy is used to simplify the computations. Support vector regression improved the generalisation performance of the fuzzy rule-based system in which the fuzzy rules were a set of interpretable IF-THEN rules. The performance of the proposed model was demonstrated by conducting case studies for the non-linear system approximation and prediction of chaotic time series. The model yielded promising results and the simulation results are compared to the results published in the area

Accuracy and complexity evaluation of defuzzification strategies for the discretised interval type-2 fuzzy set.

Other research group involved: Centre for Computational Intelligence (CCI).The work reported in this paper addresses the challenge of the efficient and accurate defuzzification of discretised interval type-2 fuzzy sets. The exhaustive method of defuzzification for type-2 fuzzy sets is extremely slow, owing to its enormous computational complexity. Several approximate methods have been devised in response to this bottleneck. In this paper we survey four alternative strategies for defuzzifying an interval type-2 fuzzy set: 1. The Karnik-Mendel Iterative Procedure, 2. the Wu-Mendel Approximation, 3. the Greenfield-Chiclana Collapsing Defuzzifier, and 4. the Nie-Tan Method. We evaluated the different methods experimentally for accuracy, by means of a comparative study using six representative test sets with varied characteristics, using the exhaustive method as the standard. A preliminary ranking of the methods was achieved using a multi-criteria decision making methodology based on the assignment of weights according to performance. The ranking produced, in order of decreasing accuracy, is 1. the Collapsing Defuzzifier, 2. the Nie-Tan Method, 3. the Karnik-Mendel Iterative Procedure, and 4. the Wu-Mendel Approximation. Following that, a more rigorous analysis was undertaken by means of the Wilcoxon Nonparametric Test, in order to validate the preliminary test conclusions. It was found that there was no evidence of a significant difference between the accuracy of the Collapsing and Nie-Tan Methods, and between that of the Karnik-Mendel Iterative Procedure and the Wu-Mendel Approximation. However, there was evidence to suggest that the collapsing and Nie-Tan Methods are more accurate than the Karnik-Mendel Iterative Procedure and the Wu-Mendel Approximation. In relation to efficiency, each method’s computational complexity was analysed, resulting in a ranking (from least computationally complex to most computationally complex) as follows: 1. the Nie-Tan Method, 2. the Karnik-Mendel Iterative Procedure (lowest complexity possible), 3. the Greenfield-Chiclana Collapsing Defuzzifier, 4. the Karnik-Mendel Iterative Procedure (highest complexity possible), and 5. the Wu-Mendel Approximation