Parallel FP-Growth Algorithm Based on Constraint Rule
YANG Xiangrong
WANG Xiwu
Abstract：Frequent-Pattern Growth Algorithm(FP-Growth) is an association rules mining algorithm based on finding frequent itemsets .According to findings from actual applications ,this algorothm need to find out all frequent itemsets .On this account the mining efficiency becomes low and it can not accommodate big date mining .So ,on the basis of existing re-search ,a parallel FP-Growth algorithm is presented to accommodate big date mining and improve the efficiency of original al-gorithm .Parallel computing model(SIMD-SM ) and constraint rules are adopted in the new algorithm .The new algorithm can find out all frequent itemsets and can deal with mass data very well .
Keywords：constraint ruleparallelFP-Growthassociation rule
Publication Date：2015-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：4( 1933-1936 )