新的关联规则的挖掘与更新算法

A Novel Algorithm for Mining Association Rule and Updating

关联规则挖掘已取得了许多有效的算法,但是当事物数据库发生动态变化时,或数据库保持不变,而最小支持度和最小可信度发生变化时,关联规则的高效更新仍然是个复杂的问题。给出一种新的关联规则的挖掘算法。新的算法只需扫描数据库D一次,减少了I/O次数,为关联规则的更新打下很好的基础。

Although many efficient algorithms have been proposed for the discovery of association rules,the association rule high effect updating is still a complicated issue for dynamic databases or dynamic minimum support and minimum confidence. The paper introduces a new algorithm for updating of association rule . The new algorithm scans the database at most once and reducing the I/O times, has a good base for association rule high effected updating.