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

Swipe to show menu

book
Challenge: FP-growth Implementation

Task

Swipe to start coding

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.

Solution

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

SectionΒ 2. ChapterΒ 6
single

single

Ask AI

expand

Ask AI

ChatGPT

Ask anything or try one of the suggested questions to begin our chat

close

Awesome!

Completion rate improved to 6.67

book
Challenge: FP-growth Implementation

Task

Swipe to start coding

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.

Solution

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

close

Awesome!

Completion rate improved to 6.67

Swipe to show menu

some-alt