Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Concepts in fuzzy scaling theory: order and granularity
Fuzzy Sets and Systems - Possibility theory and fuzzy logic
Lattices of rough set abstractions as P-products
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Scale coarsening as feature selection
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
| Hi-index | 0.00 |
Rough Sets were introduced to express approximations based on an indiscernibility equivalence relation (Pawlak [4,5]). They have a natural lattice structure,which can nicely be described and widely generalised in the language of Formal Concept Analysis [2]. One instance of such a generalisation seems to be particularly promising: That of an indiscernibility preorder. The mathematical theory is almost the same as in the case of an equivalence relation, and some of the applications can be carried over. However, using preorders as indiscenibility relations needs getting used to, since such relations are not necessarily symmetric. We give an introduction and clarify the role of isolated and singleton elements.