By Topic

Attribute Reduction Algorithm and the Generation of Hybrid Decision Tree Based on Discernibility Matrix in Rough Set

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

2 Author(s)
Yang Shuqing ; Sch. of software Eng., Jianxi Univ. of Sci. & Technol., Nanchang, China ; Li Bo

Through the use of the Discernibility Matrix in Rough Set, this paper introduced an Attribute Reduction Algorithm, based on which, a new one is put forward about the Generation of Hybrid Decision Tree. This Algorithm improved the traditional method as the attributes with high frequency of occurrence in the Discernibility Matrix can classify more examples at a time. Finally, by the comparison between the Algorithm and ID3, the new Algorithm is proved to be more superior and advantageous.

Published in:

Information Science and Engineering (ISISE), 2010 International Symposium on

Date of Conference:

24-26 Dec. 2010