An efficient parallel FP-Growth algorithm

@article{Chen2009AnEP,
  title={An efficient parallel FP-Growth algorithm},
  author={Min Chen and Xuedong Gao and HuiFei Li},
  journal={2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery},
  year={2009},
  pages={283-286}
}
FP-Growth algorithm recursively generates huge amounts of conditional pattern bases and conditional FP-trees when the dataset is huge. In such a case, both the memory usage and computational cost are expensive, such that, the FP-tree can not meet the memory requirement. In this work, we propose a novel parallel FP-Growth algorithm, which is designed to run on the computer cluster. To avoid memory overflow, this algorithm finds all the conditional pattern bases of frequent items by the… CONTINUE READING
5 Citations
5 References
Similar Papers

References

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

An improved algorithm based on FPgrowth,

  • Zheng Bin, Li Juan-zi
  • Journal of Pinddingshan Institute of Technology,
  • 2009
2 Excerpts

Similar Papers

Loading similar papers…