ScholarGate
Get started

Method evidence record

FP-Growth

FP-Growth, introduced by Jiawei Han, Jian Pei, and Yiwen Yin in 2000, mines frequent itemsets from transaction data without generating candidate sets, the costly step that slows the classic Apriori algorithm. It compresses the database into a frequent-pattern tree (FP-tree) in two scans, then grows frequent patterns recursively from that structure, making it dramatically faster than Apriori on large, dense datasets.

Evidence statusSources recorded, not reviewedBibliographic sources are present. Claim-level evidence review has not been performed.

Source record

Recorded

Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.

FP-Growth (Frequent Pattern Growth)

Taxonomic method recordml-modelmachine-learning

  1. Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. · DOI 10.1145/342009.335372

  2. Han, J., Pei, J., Yin, Y., & Mao, R. (2004). Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1), 53–87. · DOI 10.1023/B:DAMI.0000005258.31418.83

Open full method2 recorded citations, copied from the method source record.

Curated claims

Assessed

Claims persisted in the evidence ledger, each with its own assessment.

No curated claims yet

This view does not invent a claim assessment when the ledger has none.

Related methods

Suggested4

Generated from the method graph and shown as machine-suggested relations. No evidence claim is inferred.