DocumentCode
3421984
Title
Different core attributes´s comparison and analysis
Author
Yang, Jun ; Xu, Zhangyan
Author_Institution
Sch. of Inf. Eng., Univ. of Sci. & Technol. Beijing, Beijing, China
fYear
2009
fDate
17-19 Aug. 2009
Firstpage
676
Lastpage
681
Abstract
The key of attribute reduction based on rough set is find the core attributes. Most existing works are mainly based on Hu´s discernibility matrix. Till now, there are three kinds of core attributes: Hu´s core based on discernibility matrix (denoted by Core1(C)), core based on positive region (denoted by Core2(C)), and core based on information entropy (denoted by Core3(C)). Some researchers have been pointed out that these three kinds of cores are not equivalent to each other. Based on the above three kinds of core attributes, we at first propose three kinds of simplified discernibility matrices and their corresponding cores, which are denoted by SDCore1(C), SDCore2(C), and SDCore3(C) respectively. And then it is proved that Core1(C)=SDCore1(C), Core2(C)= SDCore2(C), and Core3(C)=SDCore3(C). Finally, based on three proposed simplified discernibility matrices and their corresponding cores, it is proved that Core2(C)subeCore3(C)subeCore1(C).
Keywords
matrix algebra; rough set theory; attribute reduction; core attributes; discernibility matrix; information entropy; positive region; rough set; Algebra; Computational complexity; Information analysis; Information entropy; Partitioning algorithms; Set theory; Core; HU´s discernibility matrix; Information entropy; Positive region; Rough set; Simplified discernibility matrix;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing, 2009, GRC '09. IEEE International Conference on
Conference_Location
Nanchang
Print_ISBN
978-1-4244-4830-2
Type
conf
DOI
10.1109/GRC.2009.5255032
Filename
5255032
Link To Document