Question: Using FP Growth Algorithm, construct an FP tree for the dataset presented. Again, assume minimum support of 40%. For items with same support, use alphabetic
Using FP Growth Algorithm, construct an FP tree for the dataset presented. Again, assume minimum support of 40%. For items with same support, use alphabetic order to sort.
| TransID | Items |
| 1 | A,B,E |
| 2 | C,E,F |
| 3 | A,B,C,F |
| 4 | B,E,F |
| 5 | C,D,E |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
