Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
A Logical Generalization of Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Generalized Formal Concept Analysis
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Conditional functional dependencies: an FCA point of view
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Attribute exploration of many-valued context with SAT
CIMMACS'11/ISP'11 Proceedings of the 10th WSEAS international conference on Computational Intelligence, Man-Machine Systems and Cybernetics, and proceedings of the 10th WSEAS international conference on Information Security and Privacy
Normalized-scale Relations and Their Concept Lattices in Relational Databases
Fundamenta Informaticae
| Hi-index | 0.00 |
We propose an approach to many-valued contexts using formal descriptions instead of scaling. The underlying idea is the philosphical definition of a concept as a set of objects together with the most precise description. We introduce a formal description as a mapping from the set of attributes to the power set of the values (which is extended appropriately to empty cells), assigning to each attribute the set of allowed values. Descriptions are naturally ordered by preciseness. Using this, we can introduce extent and intent according to the philosophical idea, and thus we define concepts. We present a way to restrict the amount of concepts for a many-valued context by preselecting some descriptions of interest. Furthermore, we introduce implications on descriptions, allowing to investigate relationships between attributes. Within this approach, we reformulate the known theory under a different point of view. It certainly does not provide a better analysis than scaling, but it allows to avoid the generation of a huge one-valued context.