Abstract
In view of the FP-Growth algorithm needs to establish huge FP-Tree to take the massive memories, when is confronted with very huge database, its algorithm obviously insufficient in efficiency, This article unified FP-Growth and Parallel Algorithm, proposed one kind association rule parallel algorithm based on the FP-Growth, this algorithm in the FP-Growth algorithm foundation, with the aid of parallel algorithm’s thought that carried on the database resolution as well as the FP-tree tree the division reasonable combination, In the task allocation, the load stabilization, has done the research, the duty rational distribution, the combination, has achieved the good load stabilization, raised the algorithm speed, this algorithm is suitable in the large-scale database carries on the data mining, compared with former algorithm had the remarkable enhancement in the efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
She, C.: The data mining algorithmic analysis and the parallel pattern study, vol. 3, pp. 44–56. University of Electronic Science and Technology of China, Chengdu (2004)
Zhang, L.b., Chi, x.B., Mo, Z.Y.: Parallel Computing Introductory Remarks 7, 3–5 (2006)
Wang, G.-r., Gu, N.-j.: An Efficient Parallel Minimum Spanning Tree Algorithm on Message Passing Parallel Machine. Journal of software 11 (2006)
Hu, k., Cheung, D.W., Xia, S.-w.: Effect of Adaptive Interval Configuration on Parallel Mining Association Riles. Journal of Software 11 (2004)
Shuichi, S.: Synchronization and Pipeline Design for a Multithreaded Massively Parallel Computer (March 1992)
Han, J.W., Pei, J., Yin, Y.W., Mao, R.Y.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery 8, 53–87 (2004)
Wang, G.-r., Gu, N.-j.: An Efficient Parallel Minimum Spanning Tree Algorithm on Message Passing Parallel Machine. Journal of Software 11 (2004)
Liu, X.: Research and apply of the connection rule based on FP-Growth calculate way 4, 6–7 (2006)
Hu, Y.: Study on data mining algorithm based on the connection rule, 8. Dalian Maritime affair University (2009)
Mao, Y.: The connection rule excavation related algorithm study, vol. (6), pp. 8–9. Southwest Jiaotong University (2009)
Qiu, R., Lan, R.: Highly effective FP-TREE foundation algorithm. Computer Science 3, 98–100 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, K., Zhang, L., Li, S., Ke, W. (2011). Research on Association Rules Parallel Algorithm Based on FP-Growth. In: Liu, C., Chang, J., Yang, A. (eds) Information Computing and Applications. ICICA 2011. Communications in Computer and Information Science, vol 244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27452-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-27452-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27451-0
Online ISBN: 978-3-642-27452-7
eBook Packages: Computer ScienceComputer Science (R0)