Skip to main content

FP-Growth advantages and disadvantages

Short answer

Advantages: no candidate generation, two database scans, compact FP-tree, faster than Apriori, divide-and-conquer finds long patterns efficiently, scalable. Disadvantages: FP-tree may not fit memory for large/sparse data, complex to implement, not suitable for incremental data, requires rebuilding if min_sup changes.

Discuss advantages and disadvantages of FP-Growth algorithm.

Advantages

  • No candidate generation: avoids the huge candidate sets of Apriori.
  • Only two database scans: one for counting items, one for building the tree.
  • Compact structure: the FP-tree compresses the data by sharing common prefixes, so mining is done on a small tree in memory.
  • Much faster than Apriori, especially for dense data and low minimum support (often by an order of magnitude).
  • Divide-and-conquer approach finds long frequent patterns efficiently; it is complete and does not lose information about the frequent itemsets.
  • Scales well; can be extended to parallel and database-projection versions.

Disadvantages

  • The FP-tree may not fit in main memory for very large or very sparse databases (little prefix sharing, a tree almost as big as the data).
  • Complex to implement and to understand compared with Apriori.
  • Building and recursively mining conditional FP-trees costs time and memory, with many recursive structures.
  • The tree is built for a given minimum support; if min_sup changes, it may need rebuilding.
  • Not suitable for incremental or streaming data without modification (inserting a new transaction can change the item order).
  • Gives only frequent itemsets; rule generation is a separate step.

✓ Answer checked by Claude Opus 5.5 (high effort)

Related questions

All Data Mining chapter 4 questions →