A fuzzy genetic algorithm for the discovery of process parameter settings using knowledge representation

In this paper, we propose a fuzzy genetic algorithm (Fuzzy-GA) approach integrating fuzzy rule sets and their membership function sets, in a chromosome. The proposed approach consists of two processes: knowledge representation and knowledge assimilation. The knowledge of process parameter setting is encoded as a string with a fuzzy rule set and the associated membership functions. The historical process data forming a combined string is used as the initial knowledge population, which is then ready for knowledge assimilation. A genetic algorithm is used to generate an optimal or nearly optimal fuzzy set and membership functions for the process parameters. The originality of this research is that the proposed system is equipped with the ability to take advantage of assessing the loss which is caused by discrepancy with a process target, thereby enabling the identification of the best set of process parameters. The approach is demonstrated by the use of an experimental example drawn from a semiconductor manufacturer and the results show us that the suggested approach is able to achieve an optimal solution for a process parameter setting problem.     

AN IMPROVED KNOWLEDGE-ACQUISITION STRATEGY BASED ON GENETIC PROGRAMMING

Knowledge acquisition can deal with the task of extracting desirable or useful knowledge from data sets for a practical application. In this paper, we have modified our previous gp-based learning strategy to search for an appropriate classification tree. The proposed approach consists of three phases: knowledge creation, knowledge evolution, and knowledge output. In the creation phase, a set of classification trees are randomly generated to form an initial knowledge population. In the evolution phase, the genetic programming technique is used to generate a good classification tree. In the output phase, the final derived classification tree is transferred as a rule set, then outputted to the knowledge base to facilitate the inference of new data. One new genetic operator, separation, is designed in this proposed approach to remove contradiction, thus producing more accurate classification rules. Experimental results from the diagnosis of breast cancers also show the feasibility of the proposed algorithm.     

Learning Premises of Fuzzy Rules for Knowledge Acquisition in Classification Problems

A key issue in building fuzzy classification systems is the specification of rule conditions, which determine the structure of a knowledge base. This paper presents a new approach to automatically extract classification knowledge from numerical data by means of premise learning. A genetic algorithm is employed to search for premise structure in combination with parameters of membership functions of input fuzzy sets to yield optimal conditions of classification rules. The major advantage of our work is that a parsimonious knowledge base with a low number of rules can be achieved. The practical applicability of the proposed method is examined by computer simulations on two well-known benchmark problems of Iris Data and Cancer Data classification. Received 11 February 1999 / Revised 13 January 2001 / Accepted in revised form 13 February 2001     

Evolutionary design of a fuzzy classifier from data

Genetic algorithms show powerful capabilities for automatically designing fuzzy systems from data, but many proposed methods must be subjected to some minimal structure assumptions, such as rule base size. In this paper, we also address the design of fuzzy systems from data. A new evolutionary approach is proposed for deriving a compact fuzzy classification system directly from data without any a priori knowledge or assumptions on the distribution of the data. At the beginning of the algorithm, the fuzzy classifier is empty with no rules in the rule base and no membership functions assigned to fuzzy variables. Then, rules and membership functions are automatically created and optimized in an evolutionary process. To accomplish this, parameters of the variable input spread inference training (VISIT) algorithm are used to code fuzzy systems on the training data set. Therefore, we can derive each individual fuzzy system via the VISIT algorithm, and then search the best one via genetic operations. To evaluate the fuzzy classifier, a fuzzy expert system acts as the fitness function. This fuzzy expert system can effectively evaluate the accuracy and compactness at the same time. In the application section, we consider four benchmark classification problems: the iris data, wine data, Wisconsin breast cancer data, and Pima Indian diabetes data. Comparisons of our method with others in the literature show the effectiveness of the proposed method.     

Simultaneous design of membership functions and rule sets for fuzzycontrollers using genetic algorithms

This paper examines the applicability of genetic algorithms (GA's) in the simultaneous design of membership functions and rule sets for fuzzy logic controllers. Previous work using genetic algorithms has focused on the development of rule sets or high performance membership functions; however, the interdependence between these two components suggests a simultaneous design procedure would be a more appropriate methodology. When GA's have been used to develop both, it has been done serially, e.g., design the membership functions and then use them in the design of the rule set. This, however, means that the membership functions were optimized for the initial rule set and not the rule set designed subsequently. GA's are fully capable of creating complete fuzzy controllers given the equations of motion of the system, eliminating the need for human input in the design loop. This new method has been applied to two problems, a cart controller and a truck controller. Beyond the development of these controllers, we also examine the design of a robust controller for the cart problem and its ability to overcome faulty rules     

A New Fuzzy Set Merging Technique Using Inclusion-Based Fuzzy Clustering

This paper proposes a new method of merging parameterized fuzzy sets based on clustering in the parameters space, taking into account the degree of inclusion of each fuzzy set in the cluster prototypes. The merger method is applied to fuzzy rule base simplification by automatically replacing the fuzzy sets corresponding to a given cluster with that pertaining to cluster prototype. The feasibility and the performance of the proposed method are studied using an application in mobile robot navigation. The results indicate that the proposed merging and rule base simplification approach leads to good navigation performance in the application considered and to fuzzy models that are interpretable by experts. In this paper, we concentrate mainly on fuzzy systems with Gaussian membership functions, but the general approach can also be applied to other parameterized fuzzy sets.     

Design of fuzzy expert system for microarray data classification using a novel Genetic Swarm Algorithm

Knowledge gained through classification of microarray gene expression data is increasingly important as they are useful for phenotype classification of diseases. Different from black box methods, fuzzy expert system can produce interpretable classifier with knowledge expressed in terms of if-then rules and membership function. This paper proposes a novel Genetic Swarm Algorithm (GSA) for obtaining near optimal rule set and membership function tuning. Advanced and problem specific genetic operators are proposed to improve the convergence of GSA and classification accuracy. The performance of the proposed approach is evaluated using six gene expression data sets. From the simulation study it is found that the proposed approach generated a compact fuzzy system with high classification accuracy for all the data sets when compared with other approaches.     

A multi-level ant-colony mining algorithm for membership functions

Fuzzy data mining is used to extract fuzzy knowledge from linguistic or quantitative data. It is an extension of traditional data mining and the derived knowledge is relatively meaningful to human beings. In the past, we proposed a mining algorithm to find suitable membership functions for fuzzy association rules based on ant colony systems. In that approach, precision was limited by the use of binary bits to encode the membership functions. This paper elaborates on the original approach to increase the accuracy of results by adding multi-level processing. A multi-level ant colony framework is thus designed and an algorithm based on the structure is proposed to achieve the purpose. The proposed approach first transforms the fuzzy mining problem into a multi-stage graph, with each route representing a possible set of membership functions. The new approach then extends the previous one, using multi-level processing to solve the problem in which the maximum quantities of item values in the transactions may be large. The membership functions derived in a given level will be refined in the subsequent level. The final membership functions in the last level are then outputted to the rule-mining phase to find fuzzy association rules. Experiments are also performed to show the performance of the proposed approach. The experimental results show that the proposed multi-level ant colony systems mining approach can obtain improved results.     

一种基于遗传算法的模糊关联规则挖掘方法

文中提出了一种基于遗传算法的生成隶属度函数的方法,该方法通过遗传算法对初始种群进行优化,获得一个适应度较高的隶属度函数编码,然后再根据机场噪声数据的实际标准对优化后得到的隶属度函数进行修正,进而得到梯形分布的隶属度函数编码.最后通过得到的隶属度函数对数据进行模糊化,并采用FP-trees算法生成模糊关联规则.该文针对数量型属性提出了这种方法,它的优点是能够使通过遗传算法得到的较优的隶属度函数更加适用于实际的数据集.     

A multi-objective genetic optimization of interpretability-oriented fuzzy rule-based classifiers

The paper presents a multi-objective genetic approach to design interpretability-oriented fuzzy rule-based classifiers from data. The proposed approach allows us to obtain systems with various levels of compromise between their accuracy and interpretability. During the learning process, parameters of the membership functions, as well as the structure of the classifier's fuzzy rule base (i.e., the number of rules, the number of rule antecedents, etc.) evolve simultaneously using a Pittsburgh-type genetic approach. Since there is no particular coding of fuzzy rule structures in a chromosome (it reduces computational complexity of the algorithm), original crossover and mutation operators, as well as chromosome-repairing technique to directly transform the rules are also proposed. To evaluate both the accuracy and interpretability of the system, two measures are used. The first one – an accuracy measure – is based on the root mean square error of the system's response. The second one – an interpretability measure – is based on the arithmetic mean of three components: (a) the average length of rules (the average number of antecedents used in the rules), (b) the number of active fuzzy sets and (c) the number of active inputs of the system (an active fuzzy set or input means a set or input used by at least one fuzzy rule). Both measures are used as objectives in multi-objective (2-objective in our case) genetic optimization approaches such as well-known SPEA2 and NSGA-II algorithms. Moreover, for the purpose of comparison with several alternative approaches, the experiments are carried out both considering the so-called strong fuzzy partitions (SFPs) of attribute domains and without them. SFPs provide more semantically meaningful solutions, usually at the expense of their accuracy. The operation of the proposed technique in various classification problems is tested with the use of 20 benchmark data sets and compared to 11 alternative classification techniques. The experiments show that the proposed approach generates classifiers of significantly improved interpretability, while still characterized by competitive accuracy.     

Genetic tuning of fuzzy rule deep structures preserving interpretability and its interaction with fuzzy rule set reduction

Tuning fuzzy rule-based systems for linguistic fuzzy modeling is an interesting and widely developed task. It involves adjusting some of the components of the knowledge base without completely redefining it. This contribution introduces a genetic tuning process for jointly fitting the fuzzy rule symbolic representations and the meaning of the involved membership functions. To adjust the former component, we propose the use of linguistic hedges to perform slight modifications keeping a good interpretability. To alter the latter component, two different approaches changing their basic parameters and using nonlinear scaling factors are proposed. As the accomplished experimental study shows, the good performance of our proposal mainly lies in the consideration of this tuning approach performed at two different levels of significance. The paper also analyzes the interaction of the proposed tuning method with a fuzzy rule set reduction process. A good interpretability-accuracy tradeoff is obtained combining both processes with a sequential scheme: first reducing the rule set and subsequently tuning the model.     

A continuous ant colony system framework for fuzzy data mining

The goal of data mining is to find out interesting and meaningful patterns from large databases. In some real applications, many data are quantitative and linguistic. Fuzzy data mining was thus proposed to discover fuzzy knowledge from this kind of data. In the past, two mining algorithms based on the ant colony systems were proposed to find suitable membership functions for fuzzy association rules. They transformed the problem into a multi-stage graph, with each route representing a possible set of membership functions, and then, used the any colony system to solve it. They, however, searched for solutions in a discrete solution space in which the end points of membership functions could be adjusted only in a discrete way. The paper, thus, extends the original approaches to continuous search space, and a fuzzy mining algorithm based on the continuous ant approach is proposed. The end points of the membership functions may be moved in the continuous real-number space. The encoding representation and the operators are also designed for being suitable in the continuous space, such that the actual global optimal solution is contained in the search space. Besides, the proposed approach does not have fixed edges and nodes in the search process. It can dynamically produce search edges according to the distribution functions of pheromones in the solution space. Thus, it can get a better nearly global optimal solution than the previous two ant-based fuzzy mining approaches. The experimental results show the good performance of the proposed approach as well.     

An investigation into the application of neural networks,fuzzy logic,genetic algorithms,and rough sets to automated knowledge acquisition for classification problems

This paper presents some highlights in the application of neural networks, fuzzy logic, genetic algorithms, and rough sets to automated knowledge acquisition. These techniques are capable of dealing with inexact and imprecise problem domains and have been demonstrated to be useful in the solution of classification problems. It addresses the issue of the application of appropriate evaluation criteria such as rule base accuracy and comprehensibility for new knowledge acquisition techniques. An empirical study is then described in which three approaches to knowledge acquisition are investigated. The first approach combines neural networks and fuzzy logic, the second, genetic algorithms and fuzzy logic, and in the third a rough sets approach has been examined, and compared. In this study neural network and genetic algorithm fuzzy rule induction systems have been developed and applied to three classification problems. Rule induction software based on rough sets theory was also used to generate and test rule bases for the same data. A comparison of these approaches with the C4.5 inductive algorithm was also carried out. Our research to date indicates that, based on the evaluation criteria used, the genetic/fuzzy approach compares more than favourably with the neuro/fuzzy and rough set approaches. On the data sets used the genetic algorithm system displays a higher accuracy of classification and rule base comprehensibility than the C4.5 inductive algorithm.     

Tuning certainty factor and local weight of fuzzy production rulesby using fuzzy neural network

Approximate reasoning in a fuzzy system is concerned with inferring an approximate conclusion from fuzzy and vague inputs. There are many ways in which different forms of conclusions can be drawn. Fuzzy sets are usually represented by fuzzy membership functions. These membership functions are assumed to have a clearly defined base. For other fuzzy sets such as intelligent, smart, or beautiful, etc., it would be difficult to define clearly its base because its base may consist of several other fuzzy sets or unclear nonfuzzy bases. A method to handle this kind of fuzzy set is proposed. A fuzzy neural network (FNN) is also proposed to tune knowledge representation parameters (KRPs). The contributions are that we are able to handle a broader range of fuzzy sets and build more powerful fuzzy systems so that the conclusions drawn are more meaningful, reliable, and accurate. An experiment is presented to demonstrate how our method works.     

基于免疫原理和模糊规则的分类器设计

提出一种基于免疫原理的模糊分类系统的设计方法．该算法基于生物免疫系统中的克隆选择和超变异原理，通过抗体种群的演化来优化模糊分类规则集合，可以同时确定隶属度函数形状、规则集合以及规则的数目．针对典型数据集的仿真实验表明了本文方法的有效性．     

Type-2 fuzzy multi-intersection traffic signal control with differential evolution optimization

This paper proposes a multi-agent type-2 fuzzy logic control (FLC) method optimized by differential evolution (DE) for multi-intersection traffic signal control. Type-2 fuzzy sets can deal with models’ uncertainties efficiently because of its three-dimensional membership functions, but selecting suitable parameters of membership functions and rule base is not easy. DE is adopted to decide the parameters in the type-2 fuzzy system, as it is easy to understand, simple to implement and possesses low space complexity. In order to avoid the computational complexity, the expert rule base and the parameters of membership functions (MF) are optimized by turns. An eleven-intersection traffic network is studied in which each intersection is governed by the proposed controller. A secondary layer controller is set in every intersection to select the proper phase sequence. Furthermore, the communication among the adjacent intersections is implemented using multi-agent system. Simulation experiments are designed to compare communicative type-2 FLC optimized by DE with type-1 FLC, fixed-time signal control, etc. Experimental results indicate that our proposed method can enhance the vehicular throughput rate and reduce delay, queue length and parking rate efficiently.     

Simplifying the automatic design of a fuzzy logic controller using evolutionary programming

With the availability of a wide range of Evolutionary Algorithms such as Genetic Algorithms, Evolutionary Programming, Evolutionary Strategies and Differential Evolution, every conceivable aspect of the design of a fuzzy logic controller has been optimized and automated. Although there is no doubt that these automated techniques can produce an optimal fuzzy logic controller, the structure of such a controller is often obscure and in many cases these optimizations are simply not needed. We believe that the automatic design of a fuzzy logic controller can be simplified by using a generic rule base such as the MacVicar-Whelan rule base and using an evolutionary algorithm to optimize only the membership functions of the fuzzy sets. Furthermore, by restricting the overlapping of fuzzy sets, using triangular membership functions and singletons, and reducing the number of parameters to represent the membership functions, the design can be further simplified. This paper describes this method of simplifying the design and some experiments performed to ascertain its validity.     

Fuzzy association rule mining approaches for enhancing prediction performance

This paper presents an investigation into two fuzzy association rule mining models for enhancing prediction performance. The first model (the FCM–Apriori model) integrates Fuzzy C-Means (FCM) and the Apriori approach for road traffic performance prediction. FCM is used to define the membership functions of fuzzy sets and the Apriori approach is employed to identify the Fuzzy Association Rules (FARs). The proposed model extracts knowledge from a database for a Fuzzy Inference System (FIS) that can be used in prediction of a future value. The knowledge extraction process and the performance of the model are demonstrated through two case studies of road traffic data sets with different sizes. The experimental results show the merits and capability of the proposed KD model in FARs based knowledge extraction. The second model (the FCM–MSapriori model) integrates FCM and a Multiple Support Apriori (MSapriori) approach to extract the FARs. These FARs provide the knowledge base to be utilized within the FIS for prediction evaluation. Experimental results have shown that the FCM–MSapriori model predicted the future values effectively and outperformed the FCM–Apriori model and other models reported in the literature.     

Comparing extended classifier system and genetic programming for financial forecasting: an empirical study

As a broad subfield of artificial intelligence, machine learning is concerned with the development of algorithms and techniques that allow computers to learn. These methods such as fuzzy logic, neural networks, support vector machines, decision trees and Bayesian learning have been applied to learn meaningful rules; however, the only drawback of these methods is that it often gets trapped into a local optimal. In contrast with machine learning methods, a genetic algorithm (GA) is guaranteeing for acquiring better results based on its natural evolution and global searching. GA has given rise to two new fields of research where global optimization is of crucial importance: genetic based machine learning (GBML) and genetic programming (GP). This article adopts the GBML technique to provide a three-phase knowledge extraction methodology, which makes continues and instant learning while integrates multiple rule sets into a centralized knowledge base. Moreover, the proposed system and GP are both applied to the theoretical and empirical experiments. Results for both approaches are presented and compared. This paper makes two important contributions: (1) it uses three criteria (accuracy, coverage, and fitness) to apply the knowledge extraction process which is very effective in selecting an optimal set of rules from a large population; (2) the experiments prove that the rule sets derived by the proposed approach are more accurate than GP.     

SIGNIFICANT FUZZY RULES EXTRACTION BY AN SVD–QR-BASED APPROACH

ABSTRACT

In this article, an SVD–QR-based approach is proposed to extract the important fuzzy rules from a rule base with several fuzzy rule tables to design an appropriate fuzzy system directly from some input-output data of the identified system. A fuzzy system with fuzzy rule tables is defined to approach the input-output pairs of an identified system. In the rule base of the defined fuzzy system, each fuzzy rule table corresponds to a partition of an input space. In order to extract the important fuzzy rules from the rule base of the defined fuzzy system, a firing strength matrix determined by the membership functions of the premise fuzzy sets is constructed. According to the firing strength matrix, the number of important fuzzy rules is determined by the Singular Value Decomposition SVD, and the important fuzzy rules are selected by the SVD–QR-based method. Consequently, a reconstructed fuzzy rule base composed of significant fuzzy rules is determined by the firing strength matrix. Furthermore, the recursive least-squares method is applied to determine the consequent part of the reconstructed fuzzy system according to the gathered input-output data so that a fine fuzzy system is determined by the proposed method. Finally, three nonlinear systems illustrate the efficiency of the proposed method.