%0 Journal Article
%T An Algorithm and Its Updating Algorithm Based on FP-Tree for Mining Maximum Frequent Itemsets<br>基于FP-Tree的最大频繁项目集挖掘及更新算法
%A SONG Yu-Qing
%A ZHU Yu-Quan
%A SUN Zhi-Hui
%A CHEN Geng
%A <br>宋余庆
%A 朱玉全
%A 孙志挥
%A 陈耿
%J 软件学报
%D 2003
%I 
%X Mining maximum frequent itemsets is a key problem in many data mining application. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. In this paper, a fast algorithm DMFIA (discover maximum frequent itemsets algorithm) and its updating algorithm UMFIA (update maximum frequent itemsets algorithm) based on frequent pattern tree (FP-tree) for mining maximum frequent itemsets is proposed. The algorithm UMFIA makes use of previous mining result to cut down the cost of finding new maximum frequent itemsets in an updated database.
%K data mining
%K maximum frequent itemset
%K association rule
%K frequent pattern tree
%K incremental updating<br>数据挖掘
%K 最大频繁项目集
%K 关联规则
%K 频繁模式树
%K 增量式更新
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=A0C592C4ABA9BC4F&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=9CF7A0430CBB2DFD&sid=19C298A6E9FC7563&eid=D8780850D7A0B267&journal_id=1000-9825&journal_name=软件学报&referenced_num=94&reference_num=13