By Topic

RFRR: Robust Fuzzy Rough Reduction

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

5 Author(s)
Suyun Zhao ; Key Lab. of Data Eng. & Knowledge Eng. (Minist. of Educ.), Renmin Univ. of China, Beijing, China ; Hong Chen ; Cuiping Li ; Mengyao Zhai
more authors

This paper proposes a robust method of dimension reduction using fuzzy rough sets, in which the reduction results can reflect the reducts obtained on all of the possible parameters. Here, the reducts being obtained on all of the possible parameters mean that all of the reducts are obtained on different degrees of robustness to handle noise. This method is completely different from the existing methods of fuzzy rough reduction. The differences are shown in three aspects: the concept, the tool, and the algorithm. First, the key concept of attribute reduction is redefined in a new way. That is, the robust fuzzy rough reduct, which is shortened to a robust reduct, is proposed to reflect the classical reducts obtained on all of the possible parameters. The new “robust reduct” is not a crisp subset of condition attributes; rather, it is a fuzzy subset, whose most interesting property is that any cut set of the robust reduct is a classical reduct on a certain parameter. Second, the tool used to measure the discernibility power is different from the existing discernibility measures. In this paper, the robustness of each attribute to handle misclassification and perturbation is considered. By considering both the robustness and the discernibility, a robust fuzzy discernibility matrix is designed. Finally, the algorithms used to find the robust reducts are designed based upon the robust fuzzy discernibility matrix, which is completely different from the existing algorithms used to find the classical reducts.

Published in:

Fuzzy Systems, IEEE Transactions on  (Volume:21 ,  Issue: 5 )