In order to improve the availability in space domain and raise time efficiency of the algorithm, increasing more FP-array to decrease the traversing of FP-tree in this paper.It has put forward to applying the node switching strategy to generate more packed FP-tree.It has come up with increasing more FP-array to decrease the traversing of FP-tree.The space of storing FP-tree would be reduced, it could avoid allocating more other space and improve the utilization factor of the space.The solution indicates that the efficiency of time and space of improved FP-Growth algorithm is higher than that of classical FP-Growth algorithm and TFP-growth algorithm.What is new and original in this paper is it applies node switching strategy to generate more packed FP-tree and increasing more FP-array to decrease the traversing of FP-tree.
Xiaoling YuShuhan ZhouAijun Liu
Lei WangX. FanXinglong LiuHuan Zhao