A representation of dependence spaces and some basic algorithms
Fundamenta Informaticae
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Concept Approximation in Concept Lattice
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Modal-style operators in qualitative data analysis
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Pawlak's Information Systems in Terms of Galois Connections and Functional Dependencies
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Reduction method for concept lattices based on rough set theory and its application
Computers & Mathematics with Applications
Relations of attribute reduction between object and property oriented concept lattices
Knowledge-Based Systems
A novel approach to attribute reduction in concept lattices
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
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
| Hi-index | 0.00 |
As an effective tool for data analysis and knowledge processing, the theory of concept lattices has been studied extensively and applied to various fields. In order to discover useful knowledge, one often ignores some attributes according to a particular purpose and merely considers the subcontexts of a rather complex context. In this paper, we make a deep investigation on the theory of concept lattices of subcontexts. An approach to construct the concept lattice of a context is first presented by means of the concept lattices of its subcontexts. Then the concept lattices induced by all subcontexts of the context are considered as a set, and an order relation is introduced into the set. It is proved that the set together with the order relation is a complete lattice. Finally, the top element and the bottom element of the complete lattice are also obtained.