By Topic

Attribute selection's impact on robustness of decision trees

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
$33 $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

3 Author(s)
Jin-Feng Wang ; Sch. of Math. & Comput. Sci., Hebei Univ., China ; Xi-Zhao Wang ; Ming-Hu Ha

Most heuristic algorithms for building decision trees are based on the entropy of information. In this article, we introduce a new heuristic algorithm for decision tree generation based on the importance of attribute contributing to the classification, and apply the algorithm to several crisp databases. When the expanded attribute is selected in a specified node, we may have two choices, i.e., sensitive and insensitive attribute. Usually the sensitive attribute is selected for branching the node, but the insensitive attribute is ignored. We compare the two methods from robustness aspects by conducting experiments on several databases, in which the ID3's robustness is also included. The result indicates that the insensitive method is the most robust one.

Published in:

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

Date of Conference:

4-5 Nov. 2002