Formal Concept Analysis with Many-Sorted Attributes
ICCI '93 Proceedings of the Fifth International Conference on Computing and Information
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Knowledge reduction in decision formal contexts
Knowledge-Based Systems
International Journal of Approximate Reasoning
The strong direct product of formal contexts
Information Sciences: an International Journal
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
Relational Operations and Uncertainty Measure in Rough Relational Database
Fundamenta Informaticae
Hi-index | 0.00 |
The theory introduced, presented and developed in this paper, is concerned with Rough Concept Analysis. This theory is a synthesis of the theory of Rough Sets pioneered by Zdzislaw Pawlak [10] with the theory of Formal Concept Analysis pioneered by Rudolf Wille [11]. The central notion in this paper of a rough formal concept combines in a natural fashion the two notions of rough set and formal concept — to use a slogan: “rough set + formal concept = rough formal concept”. This paper is an extension of the paper [5] presented at the international workshop on Rough Sets and Knowledge Discovery (RSKD'93). A related paper [8] using distributed constraints provides a synthesis of the two important data modeling techniques: conceptual scaling of Formal Concept Analysis, and Entity-Relationship database modeling. A follow-up paper [9] will extend rough concept analysis from formal contexts to distributed constraints.