Consider the following transactions. Each row corresponds to a transaction where 1 corresponds to a presence...

 

Transcribed Image Text:

Consider the following transactions. Each row corresponds to a transaction where 1 corresponds to a presence of an item and 0 corresponds to an absence. T t t t3 t4 A B C 1 0 0 1 1 0 1 0 0 1 0 0 1 1 1 1 (a) [5 Marks, 4000-enrollment only] Let the minimum support threshold be 2. Please illustrate the four steps of the FP-tree growth algorithm with the above example. (b) [5 Marks, 6000-enrollment only] An itemset Y is a proper super-itemset of X if XCY. An itemset X is said to be closed if there exists no proper super-itemset Y such that Y has the same support count as X. Please illustrate how to use the FP-tree growth algorithm to compute all closed itemsets of support > 2 using the above example. Consider the following transactions. Each row corresponds to a transaction where 1 corresponds to a presence of an item and 0 corresponds to an absence. T t t t3 t4 A B C 1 0 0 1 1 0 1 0 0 1 0 0 1 1 1 1 (a) [5 Marks, 4000-enrollment only] Let the minimum support threshold be 2. Please illustrate the four steps of the FP-tree growth algorithm with the above example. (b) [5 Marks, 6000-enrollment only] An itemset Y is a proper super-itemset of X if XCY. An itemset X is said to be closed if there exists no proper super-itemset Y such that Y has the same support count as X. Please illustrate how to use the FP-tree growth algorithm to compute all closed itemsets of support > 2 using the above example.

Answer rating: 100% (QA)

a Illustration of the four steps of the FPtree growth algorithm Step 1 Create the FPtree structure T... View the full answer