Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Discovering Frequent Closed Itemsets for Association Rules
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Theory of Relational Databases
Theory of Relational Databases
Constructing Iceberg Lattices from Frequent Closures Using Generators
DS '08 Proceedings of the 11th International Conference on Discovery Science
About the lossless reduction of the minimal generator family of a context
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
On the complexity of computing generators of closed sets
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Formal concept analysis in knowledge discovery: a survey
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Diagnostic tests based on knowledge states
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part III
Galois sub-hierarchy and orderings
AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Building a generic graph-based descriptor set for use in drug discovery
AusDM '09 Proceedings of the Eighth Australasian Data Mining Conference - Volume 101
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
Hi-index | 0.00 |
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equivalence relation over the powerset of the ground set. As such, they appear in both theoretical and practical problem settings related to closures that stem from fields as diverging as graph theory, database design and data mining. In FCA, though, they have been almost ignored, a fact that has motivated our long-term study of the underlying structures under different perspectives. This paper is a two-fold contribution to the study of mingen families associated to a context or, equivalently, a closure space. On the one hand, it sheds light on the evolution of the family upon increases in the context attribute set (e.g., for purposes of interactive data exploration). On the other hand, it proposes a novel method for computing the mingen family that, although based on incremental lattice construction, is intended to be run in a batch mode. Theoretical and empirical evidence witnessing the potential of our approach is provided.