摘要： 针对数据库中删除数据时如何有效地更新关联规则的问题,提出了UARAD算法。该算法可以有效利用知识数据库中保留的最小非高频项目集来产生新的候选项目集,避免了候选项目集的数量太庞大的问题。

关键词: UARAD, 关联规则, 候选项目集

Abstract: To update the association rules effectively when some items of database are deleted, this paper proposes updating association rules algorithm for deleting items (UARAD). This algorithm can generate new candidate item sets effectively using the frequent item sets in the knowledge database, so it can avoid the problem that candidate item sets is very large.

中图分类号: 

• TP311.13