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
Transactions on rough sets VI
Lattices of rough set abstractions as P-products
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Algebraic structures for rough sets
Transactions on Rough Sets II
Approximations in concept lattices
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In [3] the classical rough set approach was generalized in the manner that lower and upper approximations were replaced by arbitrary kernel and closure operators respectively. Furthermore, the resulting lattices of rough set abstractions were described as P-products . This approach, though promising, needs additional research to become part of a unifying theory of Rough Set Theory and Formal Concept Analysis. For example, the role of robust elements and the possible existence of suitable negation operators were not addressed. We present results in these directions and on the structure of these lattices.