Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets
Minimal and maximal descriptions of concepts are two important notions in covering-based rough sets. Many issues in covering-based rough sets (e.g., reducts, approximations, etc.) are related to them. It is well known that, it is time-consuming and error-prone when set representations are used to co...
Saved in:
Published in | Information sciences Vol. 539; pp. 312 - 326 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.10.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!