Design Of Fuzzy Rule-based Classifiers Research Articles

A Co-optimization PSO for Fuzzy Rule-Based Classifier Design Problem Based on Enlarged Hedge Algebras

Fuzzy Rule-Based Classifier (FRBC) design problem has been widely studied due to many practical applications. Hedge Algebras based Classifier Design Methods (HACDMs) are the outstanding and effective approaches because these approaches based on a mathematical formal formalism allowing the fuzzy sets based computational semantics generated from their inherent qualitative semantics of linguistic terms. HACDMs include two phase optimization process. The first phase is to optimize the semantic parameter values by applying an optimization algorithm. Then, in the second phase, the optimal fuzzy rule based system for FRBC is extracted based on the optimal semantic parameter values provided by the first phase. The performance of FRBC design methods depends on the quality of the applied optimization algorithms. This paper presents our proposed co-optimization Particle Swarm Optimization (PSO) algorithm for designing FRBC with trapezoidal fuzzy sets based computational semantics generated by Enlarged Hedge Algebras (EHAs). The results of experiments executed over 23 real world datasets have shown that Enlarged Hedge Algebras based classifier with our proposed co-optimization PSO algorithm outperforms the existing classifiers which are designed based on Enlarged Hedge Algebras methodology with two phase optimization process and the existing fuzzy set theory based classifiers.

A HEDGE ALGEBRAS BASED REASONING METHOD FOR FUZZY RULE BASED CLASSIFIER

The fuzzy rule based classifier (FRBC) design methods have intensively been being studied during last years. The ones designed by utilizing hedge algebras as a formalism to generate the optimal linguistic values along with their (triangular and trapezoidal) fuzzy sets based semantics for the FRBCs have been proposed. Those design methods generate the fuzzy sets based semantics because the classification reasoning method still bases on the fuzzy set theory. One question which has been arisen is whether there is a pure hedge algebras classification reasoning method so that the fuzzy sets based semantic of the linguistic values in the fuzzy rule bases can be replaced with the hedge algebras based semantic. This paper answers that question by presenting a fuzzy rule based classifier design method based on hedge algebras with a pure hedge algebras classification reasoning method. The experimental results over 17 real world datasets are compared to the existing methods based on hedge algebras and fuzzy sets theory showing that the proposed method is effective and produces good results.

Design of Fuzzy Rule-based Classifiers through Granulation and Consolidation

Abstract This paper addresses the issue how to strike a good balance between accuracy and compactness in classification systems - still an important question in machine learning and data mining. The fuzzy rule-based classification approach proposed in current paper exploits the method of rule granulation for error reduction and the method of rule consolidation for complexity reduction. The cooperative nature of those methods - the rules are split in a way that makes efficient rule consolidation feasible and rule consolidation itself is capable of further error reduction - is demonstrated in a number of experiments with nine benchmark classification problems. Further complexity reduction, if necessary, is provided by rule compression.

An application of feature selection for the fuzzy rule based classifier design with the order based sematics of linguistic terms for high-dimensional datasets

An application of feature selection for the fuzzy rule based classifier design with the order based sematics of linguistic terms for high-dimensional datasets

Repeated double cross-validation for choosing a single solution in evolutionary multi-objective fuzzy classifier design

The main advantage of multi-objective genetic fuzzy systems (MoGFS) is that a number of non-dominated fuzzy rule-based systems are obtained along the tradeoff surface among conflicting objectives. Accuracy maximization, complexity minimization and interpretability maximization have often been used for multi-objective design of fuzzy rule-based classifiers. A number of non-dominated fuzzy rule-based classifiers are obtained by a single run of MoGFS. A human decision maker is supposed to choose a single final classifier from a number of obtained classifiers according to his/her preference. One problem, which has not been discussed in many studies on MoGFS, is how to choose a single final classifier. In this paper, we discuss classifier selection with no intervention of the decision maker. Whereas complexity and interpretability are very important factors in classifier selection, we concentrate on the maximization of generalization ability as the first step towards a more general handling of classifier selection. We propose the use of repeated double cross-validation (rdCV) to choose a single final classifier and to evaluate the generalization ability of the selected classifier. We also discuss how our approach can be applied to parameter specification, formulation selection and algorithm choice.

Design of fuzzy rule-based classifiers with semantic cointension

In computing with words (CWW), knowledge is linguistically represented and has an explicit semantics defined through fuzzy information granules. The linguistic representation, in turn, naturally bears an implicit semantics that belongs to users reading the knowledge base; hence a necessary condition for achieving interpretability requires that implicit and explicit semantics are cointensive. Interpretability is definitely stringent when knowledge must be acquired from data through inductive learning. Therefore, in this paper we propose a methodology for designing interpretable fuzzy models through semantic cointension. We focus our analysis on fuzzy rule-based classifiers (FRBCs), where we observe that rules resemble logical propositions, thus semantic cointension can be partially regarded as the fulfillment of the “logical view”, i.e. the set of basic logical laws that are required in any logical system. The proposed approach is grounded on the employment of a couple of tools: DC f, which extracts interpretable classification rules from data, and Espresso, that is capable of fast minimization of Boolean propositions. Our research demonstrates that it is possible to design models that exhibit good classification accuracy combined with high interpretability in the sense of semantic cointension. Also, structural parameters that quantify model complexity show that the derived models are also simple enough to be read and understood.