Question: 2 FP - growth ( 3 P ) Consider the transaction database in Table 1 again, and let minSup = 3 8 . ( 1
FPgrowth P
Consider the transaction database in Table again, and let minSup
Construct the initial FPtree from this data set. Include the header table in your result.
Perform the FPgrowth recursion: For all frequent items in your initial FPtree, build their
conditional pattern bases and conditional FPtrees. List all frequent itemsets obtained in
this iteration.
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
