Optimizing hypergraph transversal computation with an anti-monotone constraint
Céline Hébert, Alain Bretto, Bruno Crémilleux · 2007
Finding hypergraph transversals is a major algorithmic issue having many relationships with the data mining area. By defining a new Galois connection, we show how it is possible to use data mining results on pattern condensed representations and the levelwise framework to improve the hypergraph transversals computation. We present a new algorithm MTMINER and experiments showing its efficiency.