About this document
FP-Growth Practice Problem by Jithin S is a document available to read on EtoBox.
The document discusses the application of the FP-growth algorithm to identify frequent itemsets from a database containing ten transactions. It specifies a minimum support count of 2 for determining which itemsets qualify as frequent. The focus is on the methodology for extracting these itemsets using the algorithm.
- Author
- Jithin S
- Language
- EN