40,377 research outputs found

    Fuzzy Decision Tree-based Inference System for Liver Disease Diagnosis

    Get PDF
    Medical diagnosis can be challenging because of a number of factors. Uncertainty in the diagnosis process arises from inaccuracy in the measurement of patient attributes, missing attribute data and limitation in the medical expert’s ability to define cause and effect relationships when there are multiple interrelated variables. Given this situation, a decision support system, which can help doctors come up with a more reliable diagnosis, can have a lot of potential. Decision trees are used in data mining for classification and regression. They are simple to understand and interpret as they can be visualized. But, one of the disadvantages of decision tree algorithms is that they deal with only crisp or exact values for data. Fuzzy logic is described as logic that is used to describe and formalize fuzzy or inexact information and perform reasoning using such information. Although both decision trees and fuzzy rule-based systems have been used for medical diagnosis, there have been few attempts to use fuzzy decision trees in combination with fuzzy rules. This study explored the application of fuzzy logic to help diagnose liver diseases based on blood test results. In this project, inference systems aimed at classifying patient data using a fuzzy decision tree and a fuzzy rule-based system were designed and implemented. Fuzzy decision tree was used to generate rules that formed the rule-base for the diagnostic inference system. Results from this study indicate that for the specific patient data set used in this experiment, the fuzzy decision tree-based inferencing out performed both the crisp decision tree and the fuzzy rule-based inferencing in classification accuracy

    Z-number-valued rule-based decision trees

    Get PDF
    As a novel architecture of a fuzzy decision tree constructed on fuzzy rules, the fuzzy rule-based decision tree (FRDT) achieved better performance in terms of both classification accuracy and the size of the resulted decision tree than other classical decision trees such as C4.5, LADtree, BFtree, SimpleCart and NBTree. The concept of Z-number extends the classical fuzzy number to model both uncertain and partial reliable information. Z-numbers have significant potential in rule-based systems due to their strong representation capability. This paper designs a Z-number-valued rulebased decision tree (ZRDT) and provides the learning algorithm. Firstly, the information gain is used to replace the fuzzy confidence in FRDT to select features in each rule. Additionally, we use the negative samples to generate the second fuzzy numbers that adjust the first fuzzy numbers and improve the model’s fit to the training data. The proposed ZRDT is compared with the FRDT with three different parameter values and two classical decision trees, PUBLIC and C4.5, and a decision tree ensemble method, AdaBoost.NC, in terms of classification effect and size of decision trees. Based on statistical tests, the proposed ZRDT has the highest classification performance with the smallest size for the produced decision tree.The project B-TIC-590-UGR20Programa Operativo FEDER 2014-2020Regional Ministry of EconomyKnowledgeEnterprise and Universities (CECEU) of AndalusiaChina Scholarship Council (CSC) (202106070037)Project PID2019-103880RB-I00MCIN/AEI/10.13039/501100011033Andalusian government through project P20_0067

    A new approach to fuzzy random forest generation

    Get PDF
    Random forests have proved to be very effective classifiers, which can achieve very high accuracies. Although a number of papers have discussed the use of fuzzy sets for coping with uncertain data in decision tree learning, fuzzy random forests have not been particularly investigated in the fuzzy community. In this paper, we first propose a simple method for generating fuzzy decision trees by creating fuzzy partitions for continuous variables during the learning phase. Then, we discuss how the method can be used for generating forests of fuzzy decision trees. Finally, we show how these fuzzy random forests achieve accuracies higher than two fuzzy rule-based classifiers recently proposed in the literature. Also, we highlight how fuzzy random forests are more tolerant to noise in datasets than classical crisp random forests

    Towards a Comprehensible and Accurate Credit Management Model: Application of four Computational Intelligence Methodologies

    Get PDF
    The paper presents methods for classification of applicants into different categories of credit risk using four different computational intelligence techniques. The selected methodologies involved in the rule-based categorization task are (1) feedforward neural networks trained with second order methods (2) inductive machine learning, (3) hierarchical decision trees produced by grammar-guided genetic programming and (4) fuzzy rule based systems produced by grammar-guided genetic programming. The data used are both numerical and linguistic in nature and they represent a real-world problem, that of deciding whether a loan should be granted or not, in respect to financial details of customers applying for that loan, to a specific private EU bank. We examine the proposed classification models with a sample of enterprises that applied for a loan, each of which is described by financial decision variables (ratios), and classified to one of the four predetermined classes. Attention is given to the comprehensibility and the ease of use for the acquired decision models. Results show that the application of the proposed methods can make the classification task easier and - in some cases - may minimize significantly the amount of required credit data. We consider that these methodologies may also give the chance for the extraction of a comprehensible credit management model or even the incorporation of a related decision support system in bankin

    On Distributed Fuzzy Decision Trees for Big Data

    Get PDF
    Fuzzy decision trees (FDTs) have shown to be an effective solution in the framework of fuzzy classification. The approaches proposed so far to FDT learning, however, have generally neglected time and space requirements. In this paper, we propose a distributed FDT learning scheme shaped according to the MapReduce programming model for generating both binary and multiway FDTs from big data. The scheme relies on a novel distributed fuzzy discretizer that generates a strong fuzzy partition for each continuous attribute based on fuzzy information entropy. The fuzzy partitions are, therefore, used as an input to the FDT learning algorithm, which employs fuzzy information gain for selecting the attributes at the decision nodes. We have implemented the FDT learning scheme on the Apache Spark framework. We have used ten real-world publicly available big datasets for evaluating the behavior of the scheme along three dimensions: 1) performance in terms of classification accuracy, model complexity, and execution time; 2) scalability varying the number of computing units; and 3) ability to efficiently accommodate an increasing dataset size. We have demonstrated that the proposed scheme turns out to be suitable for managing big datasets even with a modest commodity hardware support. Finally, we have used the distributed decision tree learning algorithm implemented in the MLLib library and the Chi-FRBCS-BigData algorithm, a MapReduce distributed fuzzy rule-based classification system, for comparative analysis. © 1993-2012 IEEE

    Grammar-Guided Genetic Programming For Fuzzy Rule-Based Classification in Credit Management

    Get PDF

    On Fuzzy Concepts

    Get PDF
    In this paper we try to combine two approaches. One is the theory of knowledge graphs in which concepts are represented by graphs. The other is the axiomatic theory of fuzzy sets (AFS). The discussion will focus on the idea of fuzzy concept. It will be argued that the fuzziness of a concept in natural language is mainly due to the difference in interpretation that people give to a certain word. As different interpretations lead to different knowledge graphs, the notion of fuzzy concept should be describable in terms of sets of graphs. This leads to a natural introduction of membership values for elements of graphs. Using these membership values we apply AFS theory as well as an alternative approach to calculate fuzzy decision trees, that can be used to determine the most relevant elements of a concept
    • 

    corecore