International Journal of Human-Computer Studies
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Incomplete Information: Structure, Inference, Complexity
Incomplete Information: Structure, Inference, Complexity
Rough set approximations in formal concept analysis
Transactions on Rough Sets V
A characterization of rough separability
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Rough set model based on formal concept analysis
Information Sciences: an International Journal
Hi-index | 0.00 |
The aim of this paper is to compare concept lattices and approximation spaces. For this purpose general approximation spaces are introduced. It is shown that formal contexts and information systems on one hand and general approximation spaces on the other could be mutually represented e.g. for every information system exists a general approximation space such that both structures determines the same indiscernibility relation. A close relationship between Pawlak's approximation spaces and general approximation spaces also holds: for each approximation space exists a general approximation space such that both spaces determine the same definable sets. It is shown on the basis of these relationships that an extent of the every formal concept is a definable set in some Pawlak's approximation space. The problem when concept lattices are isomorphic to algebras of definable sets in approximation spaces is also investigated.