1. Apply the Apriori algorithm to the dataset of transactions and identify all frequent k-itemsets.

Show all of your work. You must show candidates but can cross them off to show the ones that

pass the minimum support threshold.

Note: if a candidate itemset is pruned because it violates the Aprtori property, you must indicate

that it fails for this reason and not just because it does not achieve the necessary support count

(i.e., in these cases there is no need to actually compute the support count). So, explicitly tag the

itemsets that are pruned due to violation of the Apriori property.

(If you do not know what the Apriori property is, do not panic. You will ultimately get the exact

same answer but will just lose a few points).

2.

Find all strong association rules of the form: X ^ Y -> Z and note their confidence values. Hint:

the answer is not O so you should have at least one frequent 3-frequent itemset.

Meal Item Order 1 Order 2 Order 3 Order 4 Order 5 Order 6 Order 7 Order 8 Order 9 List of Item IDs M1, M2, M5 M2, M4 M2,M3 M1,M2,M4 M1,M4 M2, M3 MI, M3 M1, M2,M3,M5 M1, M2,M3