By Topic

The research on optimization method for dynamic reduct

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)
Jia-yang Wang ; College of Information Science and Engineering, Central South University, Changsha, Hunan, China, 410083 ; Shuang-ying Xue ; Si-ma Chen

The paper analyses the deficiencies of traditional generalized dynamic reduct algorithm and proposes a fast algorithm based on the validity of reduct. The algorithm only needs to calculate part of the subtable to get the generalized dynamic reduct. It decreases the number of subtables that need to calculate the reduct by using the stability threshold, and filters the reduct of subtables that are not to be the generalized dynamic reduct by utilizing the optimal stability coefficient. The result shows that the fast method is more effective than the traditional algorithm.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference:

29-31 May 2012