Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals

Nicolas Durand (1) , Mohamed Quafafou (1)

1 LSIS - Laboratoire des Sciences de l'Information et des Systèmes

In this paper, we present a new approach to approximate the negative border and the positive border of frequent itemsets. This approach is based on the transition from a border to the other one by computing the minimal transversals of a hypergraph. We also propose a new method to compute approximate minimal hypergraph transversals based on hypergraph reduction. The experiments realized on different data sets show that our propositions to approximate frequent itemset borders produce good results.

Domaines: Informatique [cs]

Nicolas Durand, Mohamed Quafafou. Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals. 16th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2014), 2014, Munich, Germany. pp.357-368. ⟨hal-01465114⟩