Sciweavers

CINQ
2004
Springer
118views Database» more  CINQ 2004»
13 years 10 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila