On generating all maximal independent sets
Information Processing Letters
Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
On the irredundant generation of knowledge spaces
Journal of Mathematical Psychology
A fast algorithm for building lattices
Information Processing Letters
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Data Structures and Algorithms
Data Structures and Algorithms
Knowledge Discovery from Very Large Databases Using Frequent Concept Lattices
ECML '00 Proceedings of the 11th European Conference on Machine Learning
Formalizing Hypotheses with Concepts
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Border algorithms for computing hasse diagrams of arbitrary lattices
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Some complexity results about essential closed sets
ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
Hardness of enumerating pseudo-intents in the lectic order
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
| Hi-index | 0.00 |
Several algorithms that generate the set of all formal concepts and graphs of line (Hasse) diagrams of concept lattices are considered. Some modifications of well-known algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparsity of underlying formal contexts.