By Topic

A Novel Attribute Reduction Algorithm Based on Rough Set and Information Entropy 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
$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

2 Author(s)
Baoyi Wang ; North China Electr. Power Univ., Baoding ; Shaomin Zhang

The incompleteness of measurement approach of importance of attribute that is based on condition entropy is analyzed and proved through example. After the information entropy of element in positive region is introduced in the measurement of importance of attribute, both a novel measurement approach of importance of attribute and a novel measurement approach of importance of single attribute relative to attribute set are put forward. Based on above ideas, a heuristic attribute reduction algorithm is constructed by adopting SGF*(a, A, D) as heuristic information. Finally, the feasibility of the measurement approach of importance of attribute and the validity of the heuristic reduction algorithm are demonstrated by some classical databases in the UCI repository.

Published in:

Computational Intelligence and Security Workshops, 2007. CISW 2007. International Conference on

Date of Conference:

15-19 Dec. 2007