Pfp: parallel fp-growth for query recommendation

@inproceedings{Li2008PfpPF,
  title={Pfp: parallel fp-growth for query recommendation},
  author={Haoyuan Li and Yi Wang and Dong Zhang and Ming Zhang and Edward Y. Chang},
  booktitle={RecSys},
  year={2008}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 61 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 375 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 233 extracted citations

376 Citations

0204060'09'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 376 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Fast algorithms for mining association rules

  • Agrawal Rakesh, Ramakrishnan Srikant
  • In Proc. 20th Int. Conf. Very Large Data Bases,
  • 1994
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…