A Survey of Fuzzy Decision Tree Classifier

Abstract

Decision-tree algorithm provides one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Over the years, additional methodologies have been investigated and proposed to deal with continuous or multi-valued data, and with missing or noisy features. Recently, with the growing popularity of fuzzy representation, some researchers have proposed to utilize fuzzy representation in decision trees to deal with similar situations. This paper presents a survey of current methods for Fuzzy Decision Tree (FDT) designment and the various existing issues. After considering potential advantages of FDT classifiers over traditional decision tree classifiers, we discuss the subjects of FDT including attribute selection criteria, inference for decision assignment and stopping criteria. To be best of our knowledge, this is the first overview of fuzzy decision tree classifier.

A Survey on various Machine Learning Approaches for ECG Analysis

“…The fuzzy decision tree provides a certain inferences and knowledge acquisition means to deal with multi-varied data, with complex or missing values (Chen et al, 2009). For the above purposes, it is widely used as interference and expert systems to provide clarity.…”

Mining sustainability indicators to classify hydrocarbon development

“…The tree is built by subdividing the training set on the basis of a criterion. DT is one of the popular methods of learning and reasoning from feature based examples [5]. These trees are constructed to help actors to make decisions.…”

A new approach to fuzzy random forest generation

“…Fuzzy decision trees are an extension of crisp decision trees to deal with uncertain data [4], [5]. Similar to a crisp decision tree, a fuzzy decision tree is a directed acyclic graph, in which each edge connects two nodes from parent node to child node.…”