Formal rough concept analysis
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.
Document Type
Conference Proceeding
DOI
https://doi.org/10.1007/978-3-540-48061-7_13
Publication Date
1-1-1999
Recommended Citation
Saquer, Jamil, and Jitender S. Deogun. "Formal rough concept analysis." In International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing, pp. 91-99. Springer, Berlin, Heidelberg, 1999.
Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
