Name
Abstract | ||
|---|---|---|
Rough sets are described by an approach using possible coverings in an incomplete information table with similarity of values. Lots of possible coverings are derived in an incomplete information table. This seems to cause difficulty due to computational complexity, but it is not, because the family of possible coverings has a lattice structure. Four approximations that make up a rough set are derived by using only two coverings: the minimum and maximum possible ones which are derived from the minimum and the maximum possible indiscernibility relations that are equal to the intersection and the union of those from possible tables. The approximations are equal to those derived using the minimum and the maximum possibly indiscernible classes. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-87334-9_7 | ROUGH SETS (IJCRS 2021) |
Keywords | DocType | Volume |
Rough sets, Incomplete information, Possible coverings, Possible indiscernibility relations | Conference | 12872 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michinori Nakata | 1 | 292 | 37.49 |
| Norio Saito | 2 | 0 | 0.34 |
| Hiroshi Sakai | 3 | 107 | 16.41 |
| Takayuki Fujiwara | 4 | 51 | 14.13 |