Upper bounds on the number of candidate itemsets in Apriori like algorithms | IEEE Conference Publication | IEEE Xplore