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

Savo Tomovic, Predrag Stanisic (2014)

Details and statistics

DOI: 10.1109/MECO.2014.6862711

access: closed

type: Conference or Workshop Paper

metadata version: 2021-02-08

a service of  Schloss Dagstuhl - Leibniz Center for Informatics