Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Modal-style operators in qualitative data analysis
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Category-Based Inductive Reasoning: Rough Set Theoretic Approach
Transactions on Rough Sets IX
Information quanta and approximation operators: once more around the track
Transactions on rough sets VIII
A rough set approach to data with missing attribute values
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Hi-index | 0.00 |
The paper studies complete and incomplete information systems, i.e. basic structures of rough set theory (RST), from the standpoint of monadic Boolean algebras (MBAs). In the first part we recall a simple characterisation of RST as a theory of MBAs. In the second part the paper discusses approximation operators obtained from incomplete information systems. In this case we lose a direct link to MBAs and thus our aim is to obtain an MBA which will additionally be interesting from the perspective of RST. In the third part we consider a simple application of approximation operators based on this MBA.