A fast algorithm for building lattices
Information Processing Letters
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
A partition-based approach towards constructing Galois (concept) lattices
Discrete Mathematics
Reduction-Based approaches towards constructing galois (concept) lattices
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Hi-index | 0.00 |
Galois (concept) lattices and formal concept analysis have been proved useful in the resolution of many problems of theoretical and practical interest. Recent studies have put the emphasis on the need for both efficient and flexible algorithms to construct the lattice. In this paper, some equivalent conditions for an attributes subset to be a reduction of a formal concept are presented. Further more, the structure of concept lattice was analyzed and it is proved that each concept is the meet of some single attribute generalized concepts. Based on the above research, reduction-based approaches towards constructing concept lattice was presented.