By Topic

Efficient hash-based approximate reduct generation

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

1 Author(s)
Pai-Chou Wang ; Dept. of Inf. Manage., Southern Taiwan Univ., Tainan, Taiwan

Approximate reduct relaxes the requirement for the discernibility preserving and it can be applied to generate approximate decision rules. To compute such reducts, discernibility matrix and sorting are commonly used and they take O(mn2) and O(m2n log n) respectively to generate a reduct where m is the total number of attributes and n is the total number of instances. Instead of applying these methods, this paper proposes a hash-based discerning algorithm and an approximate reduct can be generated in O(m2n) time. Empirical results of using four of ten most popular UCI datasets are presented and they are compared to the Rough Set Exploration System (RSES). Besides approximate reducts, the hash-based discerning algorithm can be extended to generate other reducts like possible reduct, dynamic reduct, and generalized reduct.

Published in:

Granular Computing (GrC), 2011 IEEE International Conference on

Date of Conference:

8-10 Nov. 2011