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

Savo Tomovic, Predrag Stanisic. Upper bounds on the number of candidate itemsets in Apriori like algorithms. In 3rd Mediterranean Conference on Embedded Computing, MECO 2014, Budva, Montenegro, June 15-19, 2014. pages 260-263, IEEE, 2014. [doi]

Abstract

Abstract is missing.