Database Paper Browser

Back to papers

Mining Frequent Patterns without Candidate Generation

Summary: Proposes FP-tree, a compact prefix-tree that compresses frequent-pattern data and eliminates candidate generation. FP-growth mines all patterns via pattern fragment growth and divide-and-conquer on conditional databases, cutting scans and outperforming Apriori by roughly tenfold. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3168
Venue
SIGMOD
Year
2000
Pagerank
0.00036992674
Overall Rank
181 | 98.75%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 63 citing papers.

Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers