Fuzzy neural networks with genetic algorithm-based learning method

This thesis is on the reasoning of artificial neural networks based on granules for both crisp and uncertain data. However, understanding the data in this way is difficult when the data is so complex. Reducing the complexity of the problems that these networks are attempting to learn as well as decreasing the cost of the learning processes are desired for a better prediction. A suitable prediction in artificial neural networks depends on an in-depth understanding of data and fine tracking of relations between data points. Inaccuracies of the prediction are caused by complexity of data set and the complexity is caused by uncertainty and quantity of data. Uncertainties can be represented in granules, and the reasoning based on granules is known as granular computing. This thesis proposed an improvement of granular neural networks to reach an outcome from uncertain and crisp data. Two methods based on genetic algorithms (GAs) are proposed. Firstly, GA-based fuzzy granular neural networks are improved by GA-based fuzzy artificial neural networks. They consist of two parts: granulation using fuzzy c-mean clustering (FCM), and reasoning by GAbased fuzzy artificial neural networks. In order to extract granular rules, a granulation method is proposed. The method has three stages: construction of all possible granular rules, pruning the repetition, and crossing out granular rules. Secondly, the two-phase GA-based fuzzy artificial neural networks are improved by GA-based fuzzy artificial neural networks. They are designed in two phases. In this case, the improvement is based on alpha cuts of fuzzy weight in the network connections. In the first phase, the optimal values of alpha cuts zero and one are obtained to define the place of a fuzzy weight for a network connection. Then, in the second phase, the optimal values of middle alpha cuts are obtained to define the shape of a fuzzy weight. The experiments for the two improved networks are performed in terms of generated error and execution time. The results tested were based on available rule/data sets in University of California Irvine (UCI) machine learning repository. Data sets were used for GA-based fuzzy granular neural networks, and rule sets were used for GA-based fuzzy artificial neural networks. The rule sets used were customer satisfaction, uranium, and the datasets used were wine, iris, servo, concrete compressive strength, and uranium. The results for the two-phase networks revealed the improvements of these methods over the conventional onephase networks. The two-phase GA-based fuzzy artificial neural networks improved 35% and 98% for execution time, and 27% and 26% for the generated error. The results for GA-based granular neural networks were revealed in comparison with GA-based crisp artificial neural networks. The comparison with other related granular computing methods were done using the iris benchmark data set. The results for these networks showed an average performance of 82.1%. The results from the proposed methods were analyzed in terms of statistical measurements for rule strengths and classifier performance using benchmark medical datasets. Therefore, this thesis has shown GA-based fuzzy granular neural networks, and GA-based fuzzy artificial neural networks are capable of reasoning based on granules for both crisp and uncertain data in artificial neural networks

Automatic generation of fuzzy classification rules using granulation-based adaptive clustering

A central problem of fuzzy modelling is the generation of fuzzy rules that fit the data to the highest possible extent. In this study, we present a method for automatic generation of fuzzy rules from data. The main advantage of the proposed method is its ability to perform data clustering without the requirement of predefining any parameters including number of clusters. The proposed method creates data clusters at different levels of granulation and selects the best clustering results based on some measures. The proposed method involves merging clusters into new clusters that have a coarser granulation. To evaluate performance of the proposed method, three different datasets are used to compare performance of the proposed method to other classifiers: SVM classifier, FCM fuzzy classifier, subtractive clustering fuzzy classifier. Results show that the proposed method has better classification results than other classifiers for all the datasets used

Data granulation by the principles of uncertainty

Researches in granular modeling produced a variety of mathematical models, such as intervals, (higher-order) fuzzy sets, rough sets, and shadowed sets, which are all suitable to characterize the so-called information granules. Modeling of the input data uncertainty is recognized as a crucial aspect in information granulation. Moreover, the uncertainty is a well-studied concept in many mathematical settings, such as those of probability theory, fuzzy set theory, and possibility theory. This fact suggests that an appropriate quantification of the uncertainty expressed by the information granule model could be used to define an invariant property, to be exploited in practical situations of information granulation. In this perspective, a procedure of information granulation is effective if the uncertainty conveyed by the synthesized information granule is in a monotonically increasing relation with the uncertainty of the input data. In this paper, we present a data granulation framework that elaborates over the principles of uncertainty introduced by Klir. Being the uncertainty a mesoscopic descriptor of systems and data, it is possible to apply such principles regardless of the input data type and the specific mathematical setting adopted for the information granules. The proposed framework is conceived (i) to offer a guideline for the synthesis of information granules and (ii) to build a groundwork to compare and quantitatively judge over different data granulation procedures. To provide a suitable case study, we introduce a new data granulation technique based on the minimum sum of distances, which is designed to generate type-2 fuzzy sets. We analyze the procedure by performing different experiments on two distinct data types: feature vectors and labeled graphs. Results show that the uncertainty of the input data is suitably conveyed by the generated type-2 fuzzy set models.Comment: 16 pages, 9 figures, 52 reference