The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Pfp: parallel fp-growth for query recommendation
Abstract
Frequent itemset mining (FIM) is a useful tool for discovering frequently co-occurrent items. Since its inception, a number of significant FIM algorithms have been developed to speed up mining performance. Unfortunately, when the dataset size is huge, both the memory use and computational cost can still be prohibitively expensive. In this work, we propose to parallelize the FP-Growth algorithm (we call our parallel algorithm PFP) on distributed machines. PFP partitions computation in such a way that each machine executes an independent group of mining tasks. Such partitioning eliminates computational dependencies between machines, and thereby communication between them. Through empirical study on a large dataset of 802,939 Web pages and 1,021,107 tags, we demonstrate that PFP can achieve virtually linear speedup. Besides scalability, the empirical study demonstrates that PFP to be promising for supporting query recommendation for search engines.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
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
Fast parallel association rule mining without candidacy generation
Zai͏̈ane, O. R., El-Hajj, M. I., & Lu, P. (2002) · Proceedings · doi:10.1109/icdm.2001.989600 · Cited by 152
Optimization of frequent itemset mining on multiple-core processor
Liu, L., Li, E., Zhang, Y., & Tang, Z. (2007) · Cited by 107
Parallel FP-growth on PC cluster
Pramudiono, I., & Kitsuregawa, M. (2003) · Knowledge Discovery and Data Mining · doi:10.5555/1760894.1760956 · Cited by 64
Toward terabyte pattern mining
Buehrer, G., Parthasarathy, S., Tatikonda, S., Kurç, T., & Saltz, J. (2007) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/1229428.1229432 · Cited by 54
Cited by
Sensing Trending Topics in Twitter
Aiello, L. M., Petkos, G., Martin, C., Corney, D., Papadopoulos, S., Skraba, R., Goker, A., Kompatsiaris, I., & Jaimes, A. (2013) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2013.2265080 · Cited by 431
Frequent itemset mining: A 25 years review
Luna, J. M., Fournier‐Viger, P., & Ventura, S. (2019) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1329 · Cited by 258
A distributed frequent itemset mining algorithm using Spark for Big Data analytics
Zhang, F., Liu, M., Gui, F., Shen, W., Shami, A., & Ma, Y. (2015) · Cluster Computing · doi:10.1007/s10586-015-0477-1 · Cited by 87
Human Activity Recognition Data Analysis: History, Evolutions, and New Trends
Ariza-Colpas, P. P., Vicario, E., Oviedo-Carrascal, A. I., Butt Aziz, S., Piñeres-Melo, M. A., Quintero-Linero, A., & Patara, F. (2022) · Sensors · doi:10.3390/s22093401 · Cited by 52
Metadata
- Authors
- Li, H., Wang, Y., Zhang, D., Zhang, M., & Chang, E. Y.
- Venue
- Proceedings of the 2008 ACM conference on Recommender systems
- Publisher
- ACM
- Published
- 2008-10-23
- Pages
- 107-114
- OpenAlex
- W2056910091
- Cited by
- 444
- References
- 11
- FWCI
- 8.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: Pfp: parallel fp-growth for query recommendation. https://app.cochat.ai/papers/10.1145/1454008.1454027
- The paper
- Li, H., Wang, Y., Zhang, D., Zhang, M., & Chang, E. Y. (2008). Pfp: parallel fp-growth for query recommendation. Proceedings of the 2008 ACM conference on Recommender systems. https://doi.org/10.1145/1454008.1454027
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.
