Boolean formulas and frequent sets

Authors:
Jouni K. Seppänen;Heikki Mannila
Affiliations:
HIIT Basic Research Unit, Lab. Computer and Information Science, Helsinki University of Technology, Finland;HIIT Basic Research Unit, Lab. Computer and Information Science, Helsinki University of Technology, Finland
Venue:
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Year:
2004

Citing 9
Cited 0

Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability

Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Two notes on notation

American Mathematical Monthly
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Fast discovery of association rules

Advances in knowledge discovery and data mining
Probabilistic query models for transaction data

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Approximation of Frequency Queris by Means of Free-Sets

PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Mining All Non-derivable Frequent Itemsets

PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Local and Global Methods in Data Mining: Basic Techniques and Open Problems

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Probabilistic models for query approximation with large sparse binary data sets

UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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-exclusion sum to include only the frequencies of known itemsets, give a bound for its performance on disjunctions of attributes that is smaller than the previously known bound, and show that this bound is in fact achievable. We also show how to generalize the algorithm to approximate arbitrary Boolean queries.