%0 Journal Article
%T Maximum frequent itemsets mining algorithm based on improved FP-tree<br>基于改进FP-树的最大项目集挖掘算法*
%A XIE Zhi-qiang
%A ZHU Meng-jie
%A YANG Jing
%A <br>谢志强
%A 朱孟杰
%A 杨静
%J 计算机应用研究
%D 2009
%I 
%X Mining maximum frequent itemsets is a key problem in many data mining application.FP-growth algorithm is one of the most efficient frequent pattern mining methods.However,FP-growth algorithm must generate a huge number of conditional FP-trees recursively in processes of mining maximum frequent,so the efficiency of it unsatisfactory.This paper proposed an efficient mining maximum frequent algorithm,it unified the improvement FP-tree.The FP-tree was a one-way tree and there is no pointers to point its childre...
%K data mining
%K association rule
%K maximum frequent itemsets
%K FP-tree<br>数据挖掘
%K 关联规则
%K 最大频繁项目集
%K 频繁模式树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=072522F69E2A810DC322CD0E6EE0ABD8&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=0B39A22176CE99FB&sid=51F9E747BA1ACB45&eid=42D7028D961473F8&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=12