Fuzzy SLIQ Decision Tree Algorithm

Traditional decision tree algorithms face the problem of having sharp decision boundaries which are hardly found in any real-life classification problems. A fuzzy supervised learning in Quest (SLIQ) decision tree (FS-DT) algorithm is proposed in this paper. It is aimed at constructing a fuzzy decisi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on systems, man and cybernetics. Part B, Cybernetics Jg. 38; H. 5; S. 1294 - 1301
Hauptverfasser: Chandra, B., Varghese, P.P.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States IEEE 01.10.2008
Schlagworte:
Algorithms
Boundaries
Classification
Classification tree analysis
Clouds
Computer Simulation
Construction
Crisps
Decision Support Techniques
Decision trees
Fuzzy
fuzzy decision tree
Fuzzy Logic
fuzzy membership function
Fuzzy set theory
Gini index
Machine learning
Machine learning algorithms
Models, Theoretical
Partitioning algorithms
Pattern classification
Pattern Recognition, Automated - methods
Supervised learning
fuzzy decision tree
fuzzy membership function
Gini index
Classification
ISSN:1083-4419, 1941-0492, 1941-0492
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Traditional decision tree algorithms face the problem of having sharp decision boundaries which are hardly found in any real-life classification problems. A fuzzy supervised learning in Quest (SLIQ) decision tree (FS-DT) algorithm is proposed in this paper. It is aimed at constructing a fuzzy decision boundary instead of a crisp decision boundary. Size of the decision tree constructed is another very important parameter in decision tree algorithms. Large and deeper decision tree results in incomprehensible induction rules. The proposed FS-DT algorithm modifies the SLIQ decision tree algorithm to construct a fuzzy binary decision tree of significantly reduced size. The performance of the FS-DT algorithm is compared with SLIQ using several real-life datasets taken from the UCI Machine Learning Repository. The FS-DT algorithm outperforms its crisp counterpart in terms of classification accuracy. FS-DT also results in more than 70% reduction in size of the decision tree compared to SLIQ.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:1083-4419
1941-0492
1941-0492
DOI:10.1109/TSMCB.2008.923529