1. Compute the confidences for the following rules. (20 points total)
a.) {A,B}⇒E.
b.) A⇒{B,E}.
2. Apply the Apriori procedure by using join operations as described on slide (see slide1) #15. You need to report all frequent k-itemsets.
3. Draw the FP-Tree (see slide #28).
4. Import this table by preparing an appropriate input format for Weka and run Apriori algorithm. Please use either .arff or csv format by inspecting sample Weka files. Please report the association rules you find.
5. Using Weka, implement Apriori and FP-Growth algorithms on Supermarket data, which is a sample data set coming with Weka installation. You can find it under Weka folder in your system. Please report your results with screen shots. You don’t have to report all. Top of the results is enough for this question.
