摘要
在FP-growth算法中,为了产生条件FP树,必须扫描FP树两次。提出一种新颖的FP阵列技术,将FP-tree数据结构与FP阵列有效地结合起来,直接从FP阵列得到频繁项的计数,从而省略了第一次扫描,节省了时间。尤其对于稀疏数据库,该算法在执行时间上比原FP-growth算法具有更优的性能。
In FP-growth algorithm, two traversals of FP-tree are needed for constructing the new conditional FP-tree. A novel FP-array technique was presented that greatly reduced the need to traverse FP-trees. A improved FP-growth algorithm was presented which uses the FP-tree data structure in combination with the FP-array technique efficiently. Experimental results show that the new algorithm works especially well for sparse datasets.
出处
《计算机科学》
CSCD
北大核心
2009年第7期208-210,共3页
Computer Science
基金
国家自然科学基金项目(50474052)资助
