Consider the following transaction database:
TID Items
-------------------------
01 A, B, C, D, F
02 A, B, C, D, E, G
03 A, C, G, H, K
04 B, C, D, E, H, K
05 D, E, F, H, L
06 A, B, C, K, L
07 A, D, F, L
08 B, I, E, K, L
09 C, D, F, L
10 A, B, D, E, K
11 C, D, H, I, K
12 C, E, F, K
13 B, C, D, F
14 A, B, C, D
15 C, H, I, J, K
16 A, D, E, F, H, L
17 H, K, L
18 A, D, H, K
19 D, E, F, K, L
20 B, C, D, E, H, L
Applying the Apriori algorithm with a minimum support of 30% and a minimum confidence of 75%, find all the association rules in the dataset. Give details of your computation at each step. However, at each step, give only the frequent itemsets that satisfy the minimum support (i.e., itemsets which appear in at least 6 transactions). Also, specify the confidence and improvement for each of the rules you discovered.