Description: found in the database model and the frequent association rules is the area of data mining the most fundamental and important issues. Most of the early studies used a similar Apriori algorithm for the selection of candidates and test-iterative way was costly, particularly mining the rich patterns and long model, Jiawei Han proposed a novel data structure FP_tree and on the basis of their FP_growth algorithm used effectively the model for long and rich patterns of excavation. This paper discussed the FP_growth algorithm on the basis of the Visual C of the algorithm, and the preparation procedure of the algorithm.
File list (Check if you may need any files):
Download