摘要
关联规则是数据挖掘的重要研究内容.由于数据库中频繁追加新数据,使得已挖掘的关联规则发生变化,递增修正技术用于维护与修正关联规则.讨论了关联规则的递增修正问题,提出了递增修正算法(FIU).FIU算法通过减小支持率,将频繁模式集合扩大,访问新追加的数据,对关联规则进行修正.FIU算法减少了数据的访问,提高了递增修正的速度.分析了支持率和频繁模式集合大小的关系,并对算法FIU和算法FUP进行了比较.
Mining association rule is an important aspect of data mining. As new data is added frequently, the discovered association rules may be invalid. The incremental updating technique can maintain the discovered association rules. The incremental updating for association rules is addressed and an algorithm FIU is proposed in the paper, which decreases the support, enlarges the frequent itemsets, and accesses the new added data to maintain association rules. It can decrease the access to database and speed up the incremental updating. The relation between the suppport and the number of frequent itemsets is analyzed and a comparison between the algorithms FIU and FUP is made.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
1998年第8期137-139,共3页
Journal of Shanghai Jiaotong University