Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (6): 130-132.DOI: 10.3778/j.issn.1002-8331.2010.06.037

• 数据库、信号与信息处理 • Previous Articles     Next Articles

FP-array improved FP-growth algorithm

TAN Jun1,2,BU Ying-yong2,YANG Bo2   

  1. 1.College of Computer Science,Central South University of Forestry and Technology University,Changsha 412006,China
    2.College of Mechanical & Electrical Engineering,Central South University,Changsha 410083,China
  • Received:2008-09-01 Revised:2008-10-27 Online:2010-02-21 Published:2010-02-21
  • Contact: TAN Jun


谭 军1,2,卜英勇2,杨 勃2   

  1. 1.中南林业科技大学 计算机学院,长沙 412006
    2.中南大学 机电工程学院,长沙 410083
  • 通讯作者: 谭 军

Abstract: Two traversals of FP-tree are needed for constructing a conditional FP-tree.A FP-array technique is presented that greatly reduces the need to traverse FP-trees.A very effective closed frequent pattern algorithm is presented which uses a variation of the FP-tree structure for checking the closedness of frequent itemsets in combination with the FP-array.Experimental results show that the algorithm works especially well.

Key words: CFP-growth algorithm, CFP-tree, FP-array

摘要: 为了构造条件FP树,必须两次遍历FP树。提出一种FP阵列技术,直接从FP阵列得到频繁项的计数,从而省略了第一次遍历。为了检查闭频繁项集,采用FP树的一种变形结构,并将它与FP阵列结合起来,提出了一种高效的闭频繁模式挖掘算法。实验表明,该算法具有很好的性能。

关键词: 闭频繁模式增长算法, 闭频繁模式树, FP阵列

CLC Number: