On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Extraction of feature models from formal contexts
Proceedings of the 15th International Software Product Line Conference, Volume 2
Attribute implications in similarity-based databases: semantic entailment and nonredundant bases
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Some notes on managing closure operators
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Distributed formal concept analysis algorithms based on an iterative mapreduce framework
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Computing Formal Concepts by Attribute Sorting
Fundamenta Informaticae - Concept Lattices and Their Applications
Knowledge-Based Systems
Axiomatizing εL⊥-expressible terminological knowledge from erroneous data
Proceedings of the seventh international conference on Knowledge capture
| Hi-index | 0.00 |
We describe two algorithms for closure systems. The purpose of the first is to produce all closed sets of a given closure operator. The second constructs a minimal family of implications for the ”logic” of a closure system. These algorithms then are applied to problems in concept analysis: Determining all concepts of a given context and describing the dependencies between attributes. The problem of finding all concepts is equivalent, e.g., to finding all maximal complete bipartite subgraphs of a bipartite graph.