%0 Journal Article
%T Updating Algorithm for Association Rules Based on Fully Mining Incremental Transactions<br>基于充分挖掘增量事务的关联规则更新算法
%A CAI Jin
%A XUE Yong-Sheng
%A LIN Li
%A ZHANG Dong-Zhan
%A <br>蔡进
%A 薛永生
%A 林丽
%A 张东站
%J 计算机科学
%D 2007
%I 
%X Incremental Association rules Mining is an important content of data mining technology.This study proposes a new algorithm,called the Entirety Update Frequent Itemsets Algorithm(EUFIA)for efficiently incrementally mining association rules from large transaction database.Rather than rescanning the original database for some new generated frequent itemsets,EUFIA partitions the incremental database logically according to unit time interval,then accumulates the occurrence counts of new generated frequent itemsets and deletes infrequent itemsets obviously by backward method.Thus,EUFIA can discover newly generated frequent itemsets more efficiently and need rescan the original database only once to get overall frequent itemsets in the final database if necessary.EUFIA has good scalability in our simulation.
%K Association rules
%K Incremental updating
%K Powerful frequent itemsets
%K Inferior frequent itemsets
%K Weak frequent itemsets<br>关联规则
%K 增量式更新
%K 强频繁项集
%K 次频繁项集
%K 弱频繁项集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=88AB7933D062407C31C53FD1BA7483C4&yid=A732AF04DDA03BB3&vid=339D79302DF62549&iid=0B39A22176CE99FB&sid=1D67BE204FBF4800&eid=8B59EA573021D671&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=15