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.
Ratkaisu
Kiitos palautteestasi!
single
Kysy tekoälyä
Kysy tekoälyä
Kysy mitä tahansa tai kokeile jotakin ehdotetuista kysymyksistä aloittaaksesi keskustelumme
Tiivistä tämä luku
Explain code
Explain why doesn't solve task
Awesome!
Completion rate improved to 6.67
Challenge: FP-growth Implementation
Pyyhkäise näyttääksesi valikon
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.
Ratkaisu
Kiitos palautteestasi!
Awesome!
Completion rate improved to 6.67single