The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An implementation of the FP-growth algorithm
Abstract
The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of computing a projection of an FP-tree (the fundamental data structure of the FP-growth algorithm). In addition, projected FP-trees are (optionally) pruned by removing items that have become infrequent due to the projection (an approach that has been called FP-Bonsai). I report experimental results comparing this implementation of the FP-growth algorithm with three other frequent item set mining algorithms I implemented (Apriori, Eclat, and Relim).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
New algorithms for fast discovery of association rules
Zaki, M. J., Parthasarathy, S., Ogihara, M., & Wei, L. (1997) · Cited by 1,126
EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT
Borgelt, C. (2003) · Cited by 394
Self-citationKDD-Cup 2000 organizers' report: peeling the onion
Kohavi, R., Brodley, C. E., Frasca, B., Mason, L., & Zheng, Z. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.381033 · Cited by 256
FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
Bonchi, F., & Goethals, B. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24775-3_19 · Cited by 52
Cited by
Letham, B., Rudin, C., McCormick, T. H., & Madigan, D. (2015) · The Annals of Applied Statistics · doi:10.1214/15-aoas848 · Cited by 766
Rehman, T. U., Mahmud, M. S., Chang, Y. K., Jin, J., & Shin, J. (2019) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2018.12.006 · Cited by 415
World-scale mining of objects and events from community photo collections
Quack, T., Leibe, B., & Van Gool, L. (2008) · Proceedings of the 2008 international conference on Content-based image and video retrieval · doi:10.1145/1386352.1386363 · Cited by 262
(2015) · International Conference on Artificial Intelligence and Statistics · Cited by 162
Metadata
- Authors
- Borgelt, C.
- Venue
- Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
- Publisher
- ACM
- Published
- 2005-08-21
- Pages
- 1-5
- OpenAlex
- W2001082095
- Cited by
- 320
- References
- 10
- FWCI
- 3.39
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An implementation of the FP-growth algorithm. https://app.cochat.ai/papers/10.1145/1133905.1133907
- The paper
- Borgelt, C. (2005). An implementation of the FP-growth algorithm. Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations. https://doi.org/10.1145/1133905.1133907
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.