Search

Abstract Fuzzy rule-based models have attracted attention because of their modular architectures, well-developed design methodologies and practices as well as interpretability aspects. Methods exploiting factors of randomness offer significant efficiency and implementation simplicity that are essential in numerous application areas. In this study, we propose an original development of fuzzy rule-based models established with the aid of concepts of randomization algorithms. Several design strategies involving different random prototypes generation and basis functions approximation are studied. We investigate performance aspects of randomized rule-base and look at the performance versus the key components of the models such as the number of rules and the use of the randomized algorithms in the development. Furthermore, a comparative study is offered to quantify the efficiency of randomized algorithms. Experimental studies are reported for a series of publicly available data sets to illustrate the effectiveness of the proposed method and discuss its main features. [ABSTRACT FROM AUTHOR]

Fuzzy classifiers have been studied in the area of fuzzy sets for a long time resulting in a number of architectures. In this study, we thoroughly investigate and critically assess fuzzy rule-based classifiers. A topology of the classifier is discussed along with a discussion of the role of fuzzy set technology in the construction of condition and conclusion parts of the classification rules. Some optimization mechanisms utilized in the adjustment of information granules forming the rules are presented. Performance of the fuzzy classifiers is quantified in terms of their accuracy and an area under curve ( AUC ) determined for the receiver operating characteristics ( ROC ). The performance of the classifier is evaluated vis-à-vis a collection of triangular norms used in the construction of the fuzzy classifiers. Experimental studies involve synthetic and publicly available data. Furthermore, comparative studies include the experiments with the commonly used non-fuzzy classifiers. [ABSTRACT FROM AUTHOR]

Granular Computing (GrC) is a human-centric way to discover the fundamental structure of data sets. The resulting information granules can be efficiently exploited to organize knowledge and reveal data descriptions, which can play a pivotal role in the classification problems. Furthermore, information granules are abstract collections of data entities and exhibit flexibility and tolerance when it comes to the representation of incomplete data. However, most of the existing methods focused on the data imputation and classification separately. They also require better interpretability. The crux of this study is to develop a novel information granule-based classification method for incomplete data and a way of representing missing entities and regarding them as information granules in a unified framework. The first aspect focuses on revealing the structural backbone of multiple labeled subspaces of data by fuzzy clustering of missing values. It emerges a classifier with interpretable "IF-THEN" rules by the refinement of fuzzy prototypes in a supervised mode to capture the critical relationship of the multi-class incomplete data. The second aspect concerns the construction of some information granules to impute and represent missing values according to the refined prototypes and classification findings. The experimental studies involved synthetic and publicly available datasets in quantifying the advantages of the classification and representation abilities of the proposed methods on incomplete data. • We proposed a novel information granule-based classifier to reveal the structural of the subspaces of data, which is easier to be interpreted. • We considered incomplete data among classification modeling, so that this classifier can deal with the incomplete data straightforwardly. • We present a refinement mechanism for the information granule-based classifier to optimize the prototypes of the classification rules. • As a byproduct of the classification, the imputed information granules are distinguished from present data and have more tolerance to the imputation error. [ABSTRACT FROM AUTHOR]