An improved FP-growth algorithm based on item head table node
Ge Li · Information technology newsletter · 2012
In the association rule's mining,FP-growth algorithm is one of the most high effective algorithm,and it doesn't produce the candidate sets.It deletes the original FP-tree algorithm and the node_link field in the item header table,makes Ln as the item header table.For any frequent item ai,at first,it finds all the FP-tree nodes whose item-name has the same item name with ai,looking for the frequent pattern for every node,it can save 1/5 tree space when we found the frequent pattern for every frequent item,makes Ln as the item header table,saves head table space in order to improve the efficiency of the algorithm.The experimental results show that the improved algorithm is better than the original algorithm in performance.