Pruning and Apriori

In the video, we introduced the Apriori algorithm, which made use of the Apriori principle to prune itemsets. The Apriori principle tells us that subsets of frequent itemsets are frequent. Thus, if we find an infrequent itemset, which we'll call {X}, then it must be the case that {X, Y} is also infrequent, so we may eliminate it without computing its support.

In this exercise, you'll be given itemsets and information about the frequency of its subsets. You will need to decide whether the information is sufficient to prune the itemset or whether we need to compute its support.