Question: A database has ten transactions. Let min_sup = 30%. TID Items Bought 100 {A, B ,D, E} 200 {B, C, D} 300 {A ,B, D,
- A database has ten transactions. Let min_sup = 30%.
| TID | Items Bought |
| 100 | {A, B ,D, E} |
| 200 | {B, C, D} |
| 300 | {A ,B, D, E} |
| 400 | {A, C, D, E} |
| 500 | {B, C, D, E} |
| 600 | {B, D, E} |
| 700 | {C, D} |
| 800 | {A, B, C} |
| 900 | {A, D, E} |
| 1000 | {B, D} |
- Apply the Apriori algorithm to the above data set.
- Show the FP tree that would be made for the data set.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
