A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns
James A Bailey, Thomas Manoukian, Kotagiri Ramamohanarao · 2004
Computing the minimal transversals of a hypergraph is an important problem in computer science that has significant applications in data mining. We present a new algorithm for computing hypergraph transversals and highlight their close connection to an important class of patterns known as emerging patterns. We evaluate our technique on a number of large datasets and show that it outperforms previous approaches by a factor of 9-29 times.