- A Database Has Five Transactions Where Each Letter Represents An Item Let The Minimum Support Threshold Be 50 And The 1 (278.53 KiB) Viewed 27 times
A database has five transactions where each letter represents an item. Let the minimum support threshold be 50% and the minimum confidence threshold is 80%. TID items_bought T100 {M, O, N, K, E, Y} T200 {D, O, N, K, E, Y} T300 {M, A, K, E} T400 {M, U, C, K, Y} T500 | {C, O, O, K, I, E} 1. Find all frequent itemsets using the Apriori algorithm. Show your workâjust showing the final answer is not acceptable. For each iteration show the candidate (C) and acceptable frequent itemsets (Lj). Do not count O twice for transaction T500. 2. List all of the strong association rules, along with their support and confidence values.