A Fast Parallel Association Rules Mining Algorithm Based on FP-Forest

  • Authors:
  • Jian Hu;Xiang Yang-Li

  • Affiliations:
  • School of Management, Harbin Institute of Technology, Harbin 150001 and Research Center of Technology, Policy and Management, Harbin Institute of Technology 150001;School of Management, Harbin Institute of Technology, Harbin 150001 and Research Center of Technology, Policy and Management, Harbin Institute of Technology 150001

  • Venue:
  • ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Parallel association rules mining is a high performance mining method. Until now there are many parallel algorithms to mine association rules, this paper emphatically analyses existing parallel mining algorithms' realization skill and defects. On the basis, a new data structure, called FP-Forest, is designed with a multi-trees structure to store data. At the same time, a new parallel mining model is proposed according to the property of FP-Forest, which combines the advantage of data-parallel method and task-parallel method. First, database is reasonably divided to data processing nodes by core processor, and FP-Forest structure is built on data processing nodes for each sub-database. Secondly, core node perform a one-time synchronization merging for each FP-Forest, and every MFP-Tree on FP-Forest is dynamical assigned to corresponding mining node as sub-task by task-parallel technique. Furthermore, a fast parallel mining algorithm, namely F-FDPM, is presented to mine association rules according to above model, which mining process adopts frequent growth method basing on deepth-first searching strategy. From experimentation on real data sets, the algorithm has greatly enhanced association rules mining efficiency.