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
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
An incremental approach for attribute reduction in concept lattice
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Topological space for attributes set of a formal context
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
An approach for constructing concept lattices
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Multi-agents and non-classical logic systems
IUKM'11 Proceedings of the 2011 international conference on Integrated uncertainty in knowledge modelling and decision making
Formal concept analysis based on the topology for attributes of a formal context
Information Sciences: an International Journal
Hi-index | 0.01 |
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, the concept of attribute reduction of formal concept was proposed with its properties being discussed. The CL–Axiom and some equivalent conditions for an attributes subset to be a reduction of a formal concept are presented