Consider the following set of frequent 3-itemsets: {1, 2, 3}, {1, 2, 4}, {1, 2, 5}, {1, 3, 4}, {1, 3, 5}, {2, 3, 4},
{2, 3, 5}, {3, 4, 5}.
(a) List all candidate 4-itemsets obtained by a candidate generation procedure using the Fk-1 × F1 merging
strategy.
(b) List all candidate 4-itemsets obtained by the candidate generation procedure in Apriori.
(c) List all candidate 4-itemsets that survive the candidate pruning step of the Apriori algorithm
Sample Solution