Rough set approximations in formal concept analysis
Authors:
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 73-78 Vol.1
Abstract
An important topic of rough set theory is the approximation of undefinable sets or concepts through definable sets. It involves the construction of a system of definable sets and the definition of approximation operators. In this paper, the notion of rough set approximations is introduced into formal concept analysis. Approximation operators are defined based on both lattice-theoretic and set-theoretic operators. The results provide a better understanding of data analysis using rough set theory and formal concept analysis.Keywords
This publication has 9 references indexed in Scilit:
- Concept lattices in rough set theory2004
- On Generalizing Rough Set Theory2003
- Approximation Operators in Qualitative Data Analysis2003
- Formal Concept Analysis1999
- Formal Rough Concept Analysis1999
- Constructive and algebraic methods of the theory of rough setsInformation Sciences, 1998
- Two views of the theory of rough sets in finite universesInternational Journal of Approximate Reasoning, 1996
- From Concept Lattice to Approximation Space: Algebraic Structure of Some Spaces of Partial Objects1Fundamenta Informaticae, 1993
- Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts1982