By Topic

A decision tree based on hierarchical decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xi-Zhao Wang ; Sch. of Math. & Comput. Sci., Hebei Univ., China ; Hong-Wei Yang ; Ming-Hua Zhao ; Juan Sun

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.

Published in:

Machine Learning and Cybernetics, 2002. Proceedings. 2002 International Conference on  (Volume:4 )

Date of Conference:

4-5 Nov. 2002