Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Orthopairs: A Simple and Widely UsedWay to Model Uncertainty
Fundamenta Informaticae - Advances in Rough Set Theory
Dialectics of counting and the mathematics of vagueness
Transactions on Rough Sets XV
Approximation Algebra and Framework
Fundamenta Informaticae - Fundamentals of Knowledge Technology
| Hi-index | 0.00 |
In this paper, we discuss two extensions of rough sets and the rule extraction based on the rough sets. We introduce two interpretations of rough sets, i.e., rough sets for distinction and rough sets for approximation. Based on those different interpretations, we generalize rough sets in two different ways. The if-then rules extracted based on each generalized rough set are discussed. Based on a decision matrix, a method to extract all minimal rules from a given information table is proposed in each case. The difference of extracted rules between two generalized rough sets and the correspondence between definitions of rough sets and extracted rules are shown. Finally a simple example is given.