Abstract: Using the FP-array technology to reduce the time of FP-tree traversal，the performance of algorithm FP-growth is improved as for frequent itemsets mining because of the decreasing time.An algorithm FP-growth+ based on FP-tree for mining frequent itemsets is proposed.It can improve the efficiency of the algorithm.Lastly the algorithm is realized on experiment and is proved to be valid.

摘要： 对于频繁项集挖掘，采用一种FP-数组技术来减少FP-tree的遍历时间，减少数据集的扫描次数，在此基础上提出了一种基于FP-tree进行频繁项集挖掘的FP-growth+算法，提高了算法的效率。最后的实验证明了该算法的有效性。