Improved algorithm based on FP-Growth
Luo Yan-xia · Jisuanji gongcheng yu sheji · 2010
The FP-Growth algorithm based on FP-Tree needs to set scanning twice transaction set to create FP tree in the process of mining frequent patters,which not only reduces the efficiency of the algorithm,but also brings a burden to the database server.A new algorithm based on two-dimensional table is presented which scans at most one for the transaction set to improve the original algorithm,greatly re-ducing the time for the establishment of FP tree.Experimental results show that the algorithm is superior to the classical algorithm.