Challenge: FP-growth Implementation
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
Tack för dina kommentarer!
single
Fråga AI
Fråga AI
Fråga vad du vill eller prova någon av de föreslagna frågorna för att starta vårt samtal
Sammanfatta detta kapitel
Explain code
Explain why doesn't solve task
Awesome!
Completion rate improved to 6.67
Challenge: FP-growth Implementation
Svep för att visa menyn
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
Tack för dina kommentarer!
Awesome!
Completion rate improved to 6.67single