Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Challenge: FP-growth Implementation | Mining Frequent Itemsets
Association Rule Mining

Challenge: FP-growth ImplementationChallenge: FP-growth Implementation

Task

FP-growth algorithm can be easily implemented using the mlxtend library.
You need to use fpgrowth(encoded_data, min_support) function to get frequent itemsets on the generated dataset. Use 0.05 as a minimum support value.

Note

Pay attention that we have to one-hot-encode the transaction dataset to use the FP-growth algorithm in this task.

Everything was clear?

Section 2. Chapter 6
toggle bottom row
course content

Course Content

Association Rule Mining

Challenge: FP-growth ImplementationChallenge: FP-growth Implementation

Task

FP-growth algorithm can be easily implemented using the mlxtend library.
You need to use fpgrowth(encoded_data, min_support) function to get frequent itemsets on the generated dataset. Use 0.05 as a minimum support value.

Note

Pay attention that we have to one-hot-encode the transaction dataset to use the FP-growth algorithm in this task.

Everything was clear?

Section 2. Chapter 6
toggle bottom row
some-alt