By Topic

Decision Table Reduction Method Based on New Conditional Entropy for Rough Set Theory

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)
Lin Sun ; Coll. of Comput. & Inf. Technol., Henan Normal Univ., Xinxiang ; Jiucheng Xu ; Xizheng Cao

Some disadvantages should be discussed deeply for the current reduction algorithms. To eliminate these limitations of classical algorithms based on positive region and conditional information entropy, a new conditional entropy, which could reflect the change of decision ability objectively, was defined with separating consistent objects form inconsistent objects. To select optimal attribute reduction, the judgment theorem of reduction with an inequality was investigated. Condition attributes were considered to estimate the significance for decision classes, and a complete heuristic algorithm was designed and implemented. Finally, through analyzing the given example, the proposed heuristic information is better and more efficient than the others. Comparing the proposed algorithm with these current algorithms through discrete data sets from UCI Machine Learning Repository, the experimental results prove its validity, which enlarges the applied area of rough set.

Published in:

Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on

Date of Conference:

23-24 May 2009