Rough concept analysis: a synthesis of rough sets and formal concept analysis
Fundamenta Informaticae - Special issue: rough sets
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
Concept Approximation in Concept Lattice
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Relation between concept lattice reduction and rough set reduction
Knowledge-Based Systems
Rough set approximations in formal concept analysis
Transactions on Rough Sets V
Rough set model based on formal concept analysis
Information Sciences: an International Journal
The strong direct product of formal contexts
Information Sciences: an International Journal
Hi-index | 0.00 |
Formal concept analysis and rough set theory are two different methods for knowledge representation and knowledge discovery, and both have been successfully applied to various fields. The basis of rough set theory is an equivalence relation on a universe of objects, and that of formal concept analysis is an ordered hierarchical structure — concept lattice. This paper discusses the basic connection between formal concept analysis and rough set theory, and also analyzes the relationship between a concept lattice and the power set of a partition. Finally, it is proved that a concept lattice can be transformed into a partition and vice versa, and transformation algorithms and examples are given.