Consider the following database containing five transactions. Let min_sup = 60%. Mine all frequent itemsets using Apriori and FP-growth algorithm. Compare the efficiency of the two mining processes.
|
TID
|
Transaction
|
|
T1
|
a, c, d, f, g, i, m, p
|
|
T2
|
a, b, c, f, l, m, o
|
|
T3
|
b, f, h, j, o
|
|
T4
|
b, c, k, p, s
|
|
T5
|
a, c, e, f, l, m, n, p
|