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

bookChallenge: FP-growth Implementation

Opgave

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.

Løsning

Var alt klart?

Hvordan kan vi forbedre det?

Tak for dine kommentarer!

Sektion 2. Kapitel 6
single

single

Spørg AI

expand

Spørg AI

ChatGPT

Spørg om hvad som helst eller prøv et af de foreslåede spørgsmål for at starte vores chat

Suggested prompts:

Opsummér dette kapitel

Explain code

Explain why doesn't solve task

close

Awesome!

Completion rate improved to 6.67

bookChallenge: FP-growth Implementation

Stryg for at vise menuen

Opgave

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.

Løsning

Switch to desktopSkift til skrivebord for at øve i den virkelige verdenFortsæt der, hvor du er, med en af nedenstående muligheder
Var alt klart?

Hvordan kan vi forbedre det?

Tak for dine kommentarer!

Sektion 2. Kapitel 6
single

single

some-alt