关联规则更新的新算法

New updating algorithms on association rules

考虑事务数据库D不变,项目集I发生变化时的关联规则挖掘问题.提出了两种关联规则更新算法,解决增加项目或减少项目时的关联规则更新问题.与重新运行一遍Apriori算法相比较,其运行效率有显著提高.

This paper considers the data mining of association rules on condition that transaction database D unchanged and itemsets I changed, presents two updating algorithms for the maintenance of association rules. The two algorithms can resolve the maintenance of association rules when the item has been updated. Comparing to the Apriori algorithms, the efficience of these two kinds of algorithms have been greatly improved.