FP-Growth Algorithm: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

12 June 2024

  • curprev 23:1423:14, 12 June 2024‎ Ai talk contribs‎ 4,567 bytes +4,567‎ Created page with "== Introduction == The FP-Growth algorithm, short for Frequent Pattern Growth, is a widely used algorithm in the field of data mining for discovering frequent itemsets in large datasets. It was introduced by Jiawei Han, Jian Pei, and Yiwen Yin in 2000 as an efficient alternative to the Apriori algorithm. The FP-Growth algorithm is particularly well-suited for applications where the dataset is large and the number of frequent itemsets is substantial. == Background == T..."
Retrieved from "https://canonica.ai/page/FP-Growth_Algorithm"