计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (19): 174-176.

• 数据库与信息处理 • 上一篇    下一篇

改进的基于FP-tree的频繁项集挖掘算法

郭 伟,叶德谦   

  1. 燕山大学 信息工程学院,河北 秦皇岛 066004
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-07-01 发布日期:2007-07-01
  • 通讯作者: 郭 伟

Improved algorithm for frequent itemset mining based on FP-tree

GUO Wei,YE De-qian   

  1. Information Engineering College,Yanshan University,Qinhuangdao,Hebei 066004,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-01 Published:2007-07-01
  • Contact: GUO Wei

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

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.