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)
Incoming Non-self Citations Over Time
Authors
- 1. Jiawei Han (Simon Fraser University)
- 2. Jian Pei (Simon Fraser University)
- 3. Yiwen Yin (Simon Fraser University)
BibTeX Citation
@inproceedings{han_sigmod00,
title = {{Mining Frequent Patterns without Candidate Generation}},
author = {Han, Jiawei and Pei, Jian and Yin, Yiwen},
series = {{SIGMOD} '00},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/342009.335372},
url = {https://dl.acm.org/doi/10.1145/342009.335372},
year = {2000}
}Incoming Citations (Sorted by Pagerank)
Showing 50 of 64 citing papers.
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 29 | Fast Algorithms for Mining Association Rules | 1994 | VLDB | 0.00051189413 |
| 250 | An Effective Hash-Based Algorithm for Mining Association Rules | 1995 | SIGMOD | 0.00023145961 |
| 573 | An Efficient Algorithm for Mining Association Rules in Large Databases | 1995 | VLDB | 0.0001616577 |
| 732 | Beyond Market Baskets: Generalizing Association Rules to Correlations | 1997 | SIGMOD | 0.00014387748 |
| 913 | Efficiently Mining Long Patterns from Databases | 1998 | SIGMOD | 0.00013109093 |
| 1,006 | Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications | 1998 | SIGMOD | 0.00012567476 |
| 1,561 | Exploratory Mining and Pruning Optimizations of Constrained Association Rules | 1998 | SIGMOD | 0.00010235581 |
| 1,654 | Scalable Techniques for Mining Causal Structures | 1998 | VLDB | 9.9694714e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,782 | False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams | 2004 | VLDB |
| 2 | 5,105 | Efficient Temporal Pattern Mining in Big Time Series Using Mutual Information | 2022 | VLDB |
| 3 | 6,435 | A Regression-Based Temporal Pattern Mining Scheme for Data Streams | 2003 | VLDB |
| 4 | 14,313 | Mining Frequent Itemsets with Bit Strings and Trie | 2002 | VLDB |
| 5 | 5,674 | Mining Frequent Patterns with Differential Privacy | 2013 | VLDB |
| 6 | 913 | Efficiently Mining Long Patterns from Databases | 1998 | SIGMOD |
| 7 | 12,952 | Optimization of Frequent Itemset Mining on Multiple-Core Processor | 2007 | VLDB |
| 8 | 8,732 | A Condensed Representation to Find Frequent Patterns | 2001 | PODS |
| 9 | 14,406 | Towards Data Mining Benchmarking: A Test Bed for Performance Study of Frequent Pattern Mining | 2000 | SIGMOD |
| 10 | 3,384 | Mining Compressed Frequent-Pattern Sets | 2005 | VLDB |