%0 Journal Article
%T Updating algorithm based on matrix for mining frequent item sets<br>一种基于矩阵的频繁项集更新算法*
%A XU Jia-li
%A CHEN Jia
%A <br>徐嘉莉
%A 陈佳
%J 计算机应用研究
%D 2010
%I 
%X Aiming at updating problems of frequent item sets, this paper proposed an updating algorithm based on matrix(UABM) for mining frequent item sets.Divided the updated database into original database and new one based on time. Converted these databases into matrixes.Got the new frequent sets by matrix cropping and the bit operation, and updated the gotten frequent item sets on gotten ones.The experiments show the algorithm is not only feasible and efficient but also fit to update freguent item sets for a large-scale and dense data base.
%K data mining
%K association rules
%K frequent item sets
%K updating<br>数据挖掘
%K 关联规则
%K 频繁项集
%K 更新
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=15AE5FDA260D14076B9C159536CF63DA&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=38B194292C032A66&sid=2C8B50BA95995EA2&eid=F7B726EE3ACCF328&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11