DocumentCode
3431676
Title
A new method of attribute reduction of covering rough sets
Author
Yang, Tian ; Li, Qingguo ; Zhou, Bilei
Author_Institution
College of Science, Central South, University of Forestry and Technology, Changsha 410004, China
fYear
2012
fDate
11-13 Aug. 2012
Firstpage
596
Lastpage
600
Abstract
In rough set theory, the discernibility matrix is a classical method to compute all attribute reducts. However, it is useless in certain circumstances as shown in this paper. As a result, a new method, namely related family, is developed initially in this paper. As a more powerful tool than the discernibility matrix, relate family can compute all attribute reducts of covering generalized rough sets, not only in the cases the discernibility matrix is usually employed for, but also for more comprehensive instances to which the discernibility matrix is not applicable.
Keywords
Approximation methods; Color; Integrated circuits; Attribute Reducts; Covering; Granular Computing; Related Family; Rough Sets;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing (GrC), 2012 IEEE International Conference on
Conference_Location
Hangzhou, China
Print_ISBN
978-1-4673-2310-9
Type
conf
DOI
10.1109/GrC.2012.6468633
Filename
6468633
Link To Document