Upper bounds on the number of candidate itemsets in Apriori like algorithms.

Savo Tomovic Predrag Stanisic

Published in: MECO (2014)

Keyphrases

upper bound
itemsets
upper and lower bounds
apriori algorithm
data structure
worst case
lower bound
index structure
frequent itemsets
lower and upper bounds
brute force
constant factor
association rules
query language
multi dimensional
frequent itemset mining