Given the following transaction records (table),
Transaction Records
Transaction ID
Items
#1
apple, banana, coca-cola, doughnut
#2
banana, coco-cola
#3
banana, doughnut
#4
apple, coca-cola
#5
apple, banana, doughnut
#6
apple, banana, coca-cola
1. Build the FP-tree using a minimum support minsup =2. Show howthe tree evolves for each transaction.
2. Use the FP-Growth algorithm to discover frequent itemsetsfrom the FP-tree.
3. Suppose that {BCE} is a frequent item set, find all itsassociation rules with minimum confidence 70%.
Expert Answer
An answer will be send to you shortly. . . . .