Partial enumeration of minimal transversals of a hypergraph
Lhouari Nourine, Alain Quilliot, Hélène Toussaint · Concept Lattices and their Applications · 2015
In this paper, we propose the first approach to deal with enumeration problems with huge number of solutions, when interesting- ness measures are not known. The idea developed in the following is to partially enumerate the solutions, i.e. to enumerate only a representative sample of the set of all solutions. Clearly many works are done in data sampling, where a data set is given and the objective is to compute a representative sample. But, to our knowledge, we are the first to deal with sampling when data is given implicitly, i.e. data is obtained using an algorithm. The experiments show that the proposed approach gives good results according to several criteria (size, frequency, lexicographical order).