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]

Authors

Savo Tomovic

This author has not been identified. Look up 'Savo Tomovic' in Google

Predrag Stanisic

This author has not been identified. Look up 'Predrag Stanisic' in Google