Mining fuzzy association rules for classification problems

The effective development of data mining techniques for the discovery of knowledge from training samples for classification problems in industrial engineering is necessary in applications, such as group technology. This paper proposes a learning algorithm, which can be viewed as a knowledge acquisition tool, to effectively discover fuzzy association rules for classification problems. The consequence part of each rule is one class label. The proposed learning algorithm consists of two phases: one to generate large fuzzy grids from training samples by fuzzy partitioning in each attribute, and the other to generate fuzzy association rules for classification problems by large fuzzy grids. The proposed learning algorithm is implemented by scanning training samples stored in a database only once and applying a sequence of Boolean operations to generate fuzzy grids and fuzzy rules; therefore, it can be easily extended to discover other types of fuzzy association rules. The simulation results from the iris data demonstrate that the proposed learning algorithm can effectively derive fuzzy association rules for classification problems.     

Selecting fuzzy if-then rules for classification problems usinggenetic algorithms

This paper proposes a genetic-algorithm-based method for selecting a small number of significant fuzzy if-then rules to construct a compact fuzzy classification system with high classification power. The rule selection problem is formulated as a combinatorial optimization problem with two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy if-then rules. Genetic algorithms are applied to this problem. A set of fuzzy if-then rules is coded into a string and treated as an individual in genetic algorithms. The fitness of each individual is specified by the two objectives in the combinatorial optimization problem. The performance of the proposed method for training data and test data is examined by computer simulations on the iris data of Fisher     

Determining membership functions and minimum fuzzy support in finding fuzzy association rules for classification problems

This paper propose a new method, that employs the genetic algorithm, to find fuzzy association rules for classification problems based on an effective method for discovering the fuzzy association rules, namely the fuzzy grids based rules mining algorithm (FGBRMA). It is considered that some important parameters, including the number and shapes of membership functions in each quantitative attribute and the minimum fuzzy support, are not easily user-specified. Thus, the above-mentioned parameters are automatically determined by a binary string or chromosome is composed of two substrings: one for each quantitative attribute by the coding method proposed by Ishibuchi and Murata, and the other for the minimum fuzzy support. In each generation, the fitness value, which maximizes the classification accuracy rate and minimizes the number of fuzzy rules, of each chromosome can be obtained. When reaching the termination condition, a chromosome with maximum fitness value is then used to test its performance. For classification generalization ability, the simulation results from the iris data and the appendicitis data demonstrate that proposed method performs well in comparison with other classification methods.     

Security‐level classification for confidential documents by using adaptive neuro‐fuzzy inference systems

The security‐level detection of a confidential document is a vital task for organizations to protect their confidential information. Diverse classification rules and techniques are being applied by human experts. Increasing number of confidential information in organizations is making difficult to classify all the documents carefully with human effort. The recommended frameworks in this study classify the internal documents of TUBITAK UEKAE (National Research Institute of Electronics and Cryptology of Turkey) by using classification algorithms naïve Bayes, support vector machines (SVMs) and adaptive neuro‐fuzzy inference systems (ANFISs). A hybrid approach involving support vector classifiers and adaptive neuro‐fuzzy classifiers exposes the most successful accuracy rates of expert system classification. This study also states preprocessing tasks required for document classification with natural language processing. To represent term–document relations, a recommended metric TF‐IDF was chosen to construct a weight matrix. Agglutinative nature of Turkish documents is handled by Turkish stemming algorithms. At the end of the article, some experimental results and success metrics are projected with accuracy rates and receiver operating characteristic (ROC) curves.     

A hybrid fuzzy cognitive model based on weighted OWA operators and single‐antecedent rules

Conventional fuzzy cognitive maps (FCMs) can only represent monotonic or symmetric causal relationships and cannot simulate the AND/OR combinations of the antecedent nodes. The rule‐based fuzzy cognitive maps (RBFCMs) usually suffer from the well‐known combinatorial rule explosion problem. A hybrid fuzzy cognitive model based on weighted OWA operators and single‐antecedent rules is proposed to eliminate the drawbacks of the existing FCM models. Hybrid fuzzy cognitive maps (HFCMs) represent the causal relationships with single‐antecedent fuzzy rules and handle the various AND/OR relationships among the antecedent nodes with weighted OWA aggregation operators. Compared with conventional FCMs, HFCMs have more powerful cognitive capability. Compared with RBFCMs, HFCMs reduce the scale and complexity of the rule bases significantly and have better representation and inference performance. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 1189–1196, 2007.     

一种用于分类的改进Boosting算法

提出了一种新的Boosting算法LAdaBoost。LAdaBoost算法利用局部错误率更新样本被选用于训练下一个分类器的概率,当对一个新的样本进行分类时,考虑了该样本与其邻域内的每个训练样本的近似度;另外,提出了有效邻域的概念。根据不同的组合方法,得到了两种LAdaBoost算法,即LAdaBoost-1和LAdaBoost-2。在UCI上部分实验数据集的实验结果表明,LAdaBoost算法比AdaBoost和Bagging算法更有效,且鲁棒性更好。     

Generating fuzzy rules from training instances for fuzzy classification systems

In recent years, many methods have been proposed to generate fuzzy rules from training instances for handling the Iris data classification problem. In this paper, we present a new method to generate fuzzy rules from training instances for dealing with the Iris data classification problem based on the attribute threshold value α, the classification threshold value β and the level threshold value γ, where α  [0, 1], β  [0, 1] and γ  [0, 1]. The proposed method gets a higher average classification accuracy rate than the existing methods.     

Interpreting and extracting fuzzy decision rules from fuzzy information systems and their inference

Information systems, which contain only crisp data, precise and unique attribute values for all objects, have been widely investigated. Due to the fact that in realworld applications imprecise data are abundant, uncertainty is inherent in real information systems. In this paper, information systems are called fuzzy information systems, and formalized by (objects; attributes; f), in which f is a fuzzy set and expresses some uncertainty between an object and its attribute values. To interpret and extract fuzzy decision rules from fuzzy information systems, the meta-theory based on modal logic proposed by Resconi et al. is modified. The modified meta-theory not only expresses uncertainty between objects and their attributes, but also uncertainty in the process of recognizing fuzzy information systems. In addition, according to perception computing (proposed by Zadeh), granules of fuzzy information systems can be represented by fuzzy decision rules, so that, fuzzy inference methods can be used to obtain the decision attribute of a new object. Finally, a novel way of combining evidences based on the modified meta-theory is introduced, which extends the concept of combining evidences based on Dempster-Shafer theory.     

A characteristic-point-based fuzzy inference system aimed to minimize the number of fuzzy rules

This paper presents a characteristic-point-based fuzzy inference system (CPFIS) for fuzzy modeling from training data. The aim of the CPFIS is not only satisfactory precision performance, but also to employ as few purely linguistic fuzzy rules as possible by using a minimization-based systematic training method. Characteristic points (CPs) are defined as the few data points among the original training data which, when they are directly mapped to fuzzy rules and thus form the entire rule base, allow the underlying system to be effectively modeled. Three minimization-based algorithms in a sequence are proposed to train the CPFIS: a gradient-projection method, a Gauss-Jordan-elimination-based column elimination, and back-propagation. The CPs are determined by iterative computations of the first two minimization algorithms, after which the resulting fuzzy sets are further fine-tuned by the third algorithm. Experiments conducted on three benchmark problems showed that the CPFIS used one of the smallest number of fuzzy rules among the reported results for other methods. The Gaussian membership functions in both the input and output fuzzy sets and the small number of fuzzy rules make the rule interpretation of the CPFIS much easier than that of other methods, thus enhancing human-computer cooperation in knowledge discovery.     

改进的模糊推理规则图像边缘检测算法

图像边缘检测是数字图像处理领域的关键技术,边缘检测的结果决定了图像后续处理的质量。模糊推理规则边缘检测算法具有较强的边缘检测能力,并且具备一定的抗噪效果。但是,这种算法只在高斯噪声较小时有效,当高斯噪声较大时它的边缘检测效果甚至比Canny等算子的效果还差。针对模糊推理规则算法在强高斯噪声时效果较差的问题,提出一种改进的模糊边缘检测算法。该算法能够根据图像含噪情况调整边缘检测方案：当噪声较弱时,使用模糊推理规则边缘检测算法;当噪声较强时,为提高算法抑制噪声的能力,使用改进的模糊推理规则边缘检测算法。实验结果表明,该方法具有更好的抗噪性能和边缘检测能力。     

Increasing fuzzy rules cooperation based on evolutionary adaptive inference systems

This article presents a study on the use of parametrized operators in the Inference System of linguistic fuzzy systems adapted by evolutionary algorithms, for achieving better cooperation among fuzzy rules. This approach produces a kind of rule cooperation by means of the inference system, increasing the accuracy of the fuzzy system without losing its interpretability. We study the different alternatives for introducing parameters in the Inference System and analyze their interpretation and how they affect the rest of the components of the fuzzy system. We take into account three applications in order to analyze their accuracy in practice. © 2007 Wiley Periodicals, Inc. Int J Int Syst 22: 1035–1064, 2007.     

A high performance edge detector based on fuzzy inference rules

Edge detection is an important topic in computer vision and image processing. In this paper, a novel edge detector based on fuzzy If-Then inference rules and edge continuity is proposed. The fuzzy If-Then rule system is designed to model edge continuity criteria. The maximum entropy principle is used in the parameter adjusting process. We also discuss the related issues in designing fuzzy edge detectors. We compare it with the popular edge detectors: Sobel and Canny edge detectors. The proposed fuzzy edge detector does not need parameter setting as Canny edge detector does, and it can preserve an appropriate detection in details. It is very robust to noise and can work well under high level noise situations, while other edge detectors cannot. The detector efficiently extracts edges in images corrupted by noise without requiring the filtering process. The experimental results demonstrate the superiority of the proposed method to existing ones.     

基于Boosting算法集成遗传模糊分类器的文本分类

提出一种新颖的基于Boosting模糊分类的文本分类方法。首先采用潜在语义索引(LSI)对文本特征进行选择;然后提出Boosting算法集成模糊分类器学习,在每轮迭代训练过程中,算法通过调整训练样本的分布,利用遗传算法产生分类规则。减少分类规则能够正确分类样本的权值,使得新产生的分类规则重点考虑难于分类的样本。实验结果表明,该文本分类算法具有良好分类的性能。     

基于克隆选择的模糊分类规则提取算法

分类是许多研究领域的关键问题，模糊规则的提取质量对分类器的性能又有着极大影响．所提取的规则不仅在分类能力上要达到最优，同时在规则数量上也不能太多，否则会影响规则搜索和匹配的速度．结合人工免疫的克隆选择原理，采用克隆选择算法，提取通过多精度模糊分割产生的大量模糊if—then规则中的少数精华规则，从而建立了模糊分类所需要的有效规则集合，同时还对优化目标函数进行了改进．经仿真实验证明，该方法所提取的模糊规则具有分类准确率高，规则数目较少等特点。     

Extracting fuzzy classification rules from partially labeled data

The interpretability and flexibility of fuzzy if-then rules make them a popular basis for classifiers. It is common to extract them from a database of examples. However, the data available in many practical applications are often unlabeled, and must be labeled manually by the user or by expensive analyses. The idea of semi-supervised learning is to use as much labeled data as available and try to additionally exploit the information in the unlabeled data. In this paper we describe an approach to learn fuzzy classification rules from partially labeled datasets.     

基于云-神经网络的多属性模糊规则分类

针对模糊规则分类中数据边界硬性划分的局限性问题,建立了云-神经网络模型,并提出了基于云-神经网络的模糊规则分类算法.在不影响数据模糊性和随机性的基础上,将数据转化为规则,并利用神经网络的学习能力,进行多属性模糊规则分类,与传统方法相比,该方法在保证数据模糊性和随机性的基础上,提高了模型精度和分类准确率,应用实例表明了该方法的有效性和可行性.     

Elicitation of classification rules by fuzzy data mining

Data mining techniques can be used to find potentially useful patterns from data and to ease the knowledge acquisition bottleneck in building prototype rule-based systems. Based on the partition methods presented in simple-fuzzy-partition-based method (SFPBM) proposed by Hu et al. (Comput. Ind. Eng. 43(4) (2002) 735), the aim of this paper is to propose a new fuzzy data mining technique consisting of two phases to find fuzzy if–then rules for classification problems: one to find frequent fuzzy grids by using a pre-specified simple fuzzy partition method to divide each quantitative attribute, and the other to generate fuzzy classification rules from frequent fuzzy grids. To improve the classification performance of the proposed method, we specially incorporate adaptive rules proposed by Nozaki et al. (IEEE Trans. Fuzzy Syst. 4(3) (1996) 238) into our methods to adjust the confidence of each classification rule. For classification generalization ability, the simulation results from the iris data demonstrate that the proposed method may effectively derive fuzzy classification rules from training samples.     

基于小波隶属函数的模糊推理规则优化

隶属函数决定着模糊集的特征,建立小波基函数与隶属函数之间的联系,从而利用小波分析探讨模糊推理的实质,以一种非对称Haar小波基与三角型、梯型隶属函数的对应关系为基础,将小波分析、遗传算法与模糊系统结合,利用遗传算法实现小波隶属函数的训练学习,进而实现模糊推理规则的优化。     

基于小波隶属函数的模糊推理规则优化

隶属函数决定着模糊集的特征，建立小波基函数与隶属函数之间的联系，从而利用小波分析探讨模糊推理的实质，以一种非对称Haar小波基与三角型、梯型隶属函数的对应关系为基础，将小波分析、遗传算法与模糊系统结合，利用遗传算法实现小波隶属函数的训练学习，进而实现模糊推理规则的优化。     

A fuzzy approach to some classification problems

An appropriate algebraic structure was previously defined which can be regarded as a possible alternative to the theory of approximate reasoning, [A. Gisolfi, Fuzzy Sets Syst. 44 , 37–43 (1992)]. In this article we aim at extending the operations of the structure in order to cope with classification problems. the theoretical aspects are emphasized in order to give an adequate background to the possible applications. After defining the basic elements and the related operations, the structure is implemented by means of Prolog. Finally the relationship between the structure and the problems of classification is discussed in some detail. © 1993 John Wiley & Sons, Inc.