DocumentCode
3264451
Title
Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix
Author
Yang, Chuanjian ; Ge, Hao ; Yao, Guangshun ; Ma, Lisheng
Author_Institution
Dept. of Comput. Sci., Chuzhou Univ., Chuzhou, China
Volume
2
fYear
2009
fDate
6-7 June 2009
Firstpage
103
Lastpage
106
Abstract
In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method.
Keywords
decision tables; matrix algebra; rough set theory; attribute reduction algorithms; compatible discernibility matrix; computing core; decision table; Computational efficiency; Computational intelligence; Computer science; Rough sets; Set theory; Uncertainty; attribute reduction; core attribute; discernibility matrix; rough set;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Natural Computing, 2009. CINC '09. International Conference on
Conference_Location
Wuhan
Print_ISBN
978-0-7695-3645-3
Type
conf
DOI
10.1109/CINC.2009.212
Filename
5231022
Link To Document