Abstract
In this paper, we present a novel approach for approximating concepts in the framework of formal concept analysis. Two main problems are investigated. The first, given a set A of objects (or a set B of features), we want to find a formal concept that approximates A (or B). The second, given a pair (A,B), where A is a set of objects and B is a set of features, the objective is to find formal concepts that approximate (A,B). The techniques developed in this paper use ideas from rough set theory. The approach we present is different and more general than existing approaches.
Cite
CITATION STYLE
Saquer, J., & Deogun, J. S. (1999). Formal rough concept analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1711, pp. 91–99). Springer Verlag. https://doi.org/10.1007/978-3-540-48061-7_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
