DocumentCode
3120535
Title
A decision tree based on hierarchical decomposition
Author
Wang, Xi-Zhao ; Yang, Hong-Wei ; Zhao, Ming-hua ; Sun, Juan
Author_Institution
Sch. of Math. & Comput. Sci., Hebei Univ., China
Volume
4
fYear
2002
fDate
4-5 Nov. 2002
Firstpage
1824
Abstract
Nowadays, people often use decision tree reasoning technique to mining knowledge. The traditional decision tree, which is represented by ID3 proposed by Quinlan (1986), can solve the classification problems very well. But when the number of class increases, the single decision tree produced by ID3 turns out to be complicated and less general. This paper uses the hierarchical decomposition method to deal with multi-class problems by producing the multi-level decision trees. Compared with the single decision tree, the decision tree based on hierarchical decomposition has more advantages in handling the multi-class problems.
Keywords
data mining; decision trees; learning (artificial intelligence); ID3; decision tree; heuristic algorithm; hierarchical decomposition; inductive learning; knowledge acquisition; multiple class problems; Algorithm design and analysis; Classification tree analysis; Computer science; Decision trees; Electronic mail; Knowledge engineering; Machine learning; Mathematics; Sun; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on
Print_ISBN
0-7803-7508-4
Type
conf
DOI
10.1109/ICMLC.2002.1175355
Filename
1175355
Link To Document