A New Association Rule updated Mining Algorithm

摘要：

Mining frequent closed itemset is a key problem of association rules mining. Most of the previous algorithms can discover all the frequent closed itemset from a static database. In this paper, we introduce a new algorithm called FCIIM which can discover the increment updated frequent closed itemset by using the mined result of the last time when the new data was added to original database. By using the property of frequent closed itemset of original database and added dataset, the algorithms can discover the frequent closed itemset of increment updated database. At last we perform an experiment on a real dataset to test the algorithms. The experiment show that it is efficient for mining increment frequent closed itemsets.

关键词： Association rule Frequent closed itemset Updated mining algorithm

作者: WEN Lei

作者单位: Department of Economy and Management North China Electric Power University No.204 QingNian Road, BaoDing City, HeBei province,071003, China

会议类型: 国际会议

会议名称: 第一届国际计算机新科技与教育学术会议(Proceedings of the First International Conference on Computer Science & Education ICCSE2006)

会议地点: 厦门

会议语种:英文

页码: 101-104

在线出版日期: 2006-07-27（万方平台首次上网日期，不代表论文的发表时间）