A survey of fuzzy decision tree classifier

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...

Full description

Saved in:
Bibliographic Details
Published inFuzzy information and engineering Vol. 1; no. 2; pp. 149 - 159
Main Authors Chen, Yi-lai, Wang, Tao, Wang, Ben-sheng, Li, Zhou-jun
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer-Verlag 01.06.2009
Taylor & Francis Group
Subjects
Online AccessGet full text
ISSN1616-8658
1616-8666
DOI10.1007/s12543-009-0012-2

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1616-8658
1616-8666
DOI:10.1007/s12543-009-0012-2