Question: Using the Apriori algorithm, find the set of frequent k-itemsets Lk for k = 1, 2, 3. Consider a support threshold of 20%. Show the
Using the Apriori algorithm, find the set of frequent k-itemsets Lk for k = 1, 2, 3. Consider a support threshold of 20%. Show the set of candidates Ck and frequent k-itemsets Lk for every k.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
