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

【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.更多还原