%0 Journal Article
%T FP-array-based Improved FP-growth Algorithm<br>一种基于FP阵列技术的频繁模式挖掘算法
%A TAN Jun
%A BU Ying-yong
%A YANG Bo
%A <br>谭军
%A 卜英勇
%A 杨勃
%J 计算机科学
%D 2009
%I 
%X 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.
%K FP-growth algorithm
%K FP-tree
%K Sparse databases
%K FP-array<br>频繁模式增长算法
%K 频繁模式树
%K 稀疏数据库
%K FP阵列
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=3BBC307D703B10EE1FF397C79FB07C71&yid=DE12191FBD62783C&vid=933658645952ED9F&iid=DF92D298D3FF1E6E&sid=3D9746C06EC12B45&eid=AA27B676BFCAA4BE&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=8