Name
Abstract | ||
|---|---|---|
How to find the core attributes is important for attribute reduction based on rough set. However, there are few literatures discussing this topic, and most existing works are mainly based on Skowron's discernibility matrix. Till now, there are main three kinds of core attributes: core of the skowron's discernibility matrix (denoted by Core1(C)), core of the positive region (denoted by Core2(C)), and core of the 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. 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) subset of Core3(C) subset of Core1(C). |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10700-008-9044-z | FUZZY OPTIMIZATION AND DECISION MAKING |
Keywords | Field | DocType |
Rough set,Core,Simplified discernibility matrix,Information entropy,Skowron's discernibility matrix,Positive region | Data mining,Computer science,Variable and attribute,Artificial intelligence,Dominance-based rough set approach,Machine learning,Attribute domain | Journal |
Volume | Issue | ISSN |
7.0 | SP4.0 | 1568-4539 |
Citations | PageRank | References |
1 | 0.43 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bingru Yang | 1 | 186 | 26.67 |
| Zhangyan Xu | 2 | 97 | 10.84 |
| Wei Song | 3 | 256 | 44.41 |
| Zefeng Song | 4 | 1 | 0.77 |