A database has 5 transactions. Let min sup = 0.6 and min conf =0.8.

CustomerDateItem_bought

10010/15{C,F,A,E,D,H}

20010/15{H,A,B,C}

30010/16{D,E,C,B}

40010/18{C,A,G,D,B}

50010/19{A,H,G,C}

(1)Find all frequent itemsets using the Apriori method, and then list the frequent k-itemset for the largest k (6 points)

(2)List all closed frequent itemsets and max frequent itemsets (6 points)

(3)Listallthestrongassociationrules(withsupportandcondence)forthe following shape of rules (8 points):