Dualization of a monotone Boolean function represented by a conjunctive normal form
(CNF) is a problem which, in different disguise, is ubiquitous in many areas including …

We describe here a general approach for rare itemset mining. While mining literature has
been almost exclusively focused on frequent itemsets, in many practical situations rare ones …

A hypergraph ℱ is a set family defined on vertex set V. The dual of ℱ is the set of minimal
subsets H of V such that F∩ H≠ ø for any F∊ F. The computation of the dual is equivalent to …

Finding inclusion-minimal hitting sets (MHSs) for a given family of sets is a fundamental
combinatorial problem with applications in domains as diverse as Boolean algebra …

Several concept learning problems can be regarded as special cases of half-space
separation in abstract closure systems over finite ground sets. For the typical scenario that …

Ontology-mediated query answering is a paradigm that seeks to exploit the semantic
knowledge expressed in terms of ontologies to improve query answers over incomplete data …

We propose a methodology for hiding all sensitive frequent itemsets in a transaction
database. Our methodology relies on a novel technique that enumerates the minimal …

Rare association rules correspond to rare, or infrequent, itemsets, as opposed to frequent
ones that are targeted by conventional pattern miners. Rare rules reflect regularities of local …

The hypergraph duality problem Dual is defined as follows: given two simple hypergraphs G
and H, decide whether H consists precisely of all minimal transversals of G (in which case …

In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a
binary relation, including computing all concepts and their lattice order. We also present two …