Algebraic aspects of attribute dependencies in information systems
Fundamenta Informaticae
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Rough Sets and Concept Lattices
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Formal Concept Analysis: Foundations and Applications (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)
Attribute reduction in concept lattice based on discernibility matrix
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Classification based on logical concept analysis
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Hi-index | 0.00 |
The theory of concept lattices is an efficient tool for knowledge discovery. To make the knowledge discovery of a larger formal context easier, this paper discusses the combination and decomposition of formal contexts when the attribute set is the same, and obtains the corresponding concept lattices. First, the methods how to obtain the whole concept lattice from sub-contexts of a larger formal context is proposed. Then, the converse situation is also studied, and the method how to obtain a sub-lattice from the original formal context is given. At the same time, the relationship between intension set of original context and that of its sub-context is analyzed. Finally, the combination and decomposition theories are generalized when there are multiple sub-contexts.