4 search results - page 1 / 1 » On Computing the Minimal Generator Family for Concept Lattic... |
ICFCA
2005
Springer
13 years 10 months ago
2005
Springer
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 equiva...
DIS
2008
Springer
13 years 6 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Minimal generators (mingens) of concept intents are valuable elements of the Formal Concept Analysis (FCA) landscape, which are widely used in the database field, for da...
KDD
2007
ACM
13 years 10 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...