关联规则中支持度变化的数据重挖掘算法研究

Algorithms Research for Re-mining of Association Rules Based on Support Changes

使用关联规则进行数据挖掘时,使用者为了达到一定的挖掘效果,经常需要不断地改变关联规则的支持度阈值(support)。文中提出了一种从大型数据库中挖掘关联规则的快速算法。该算法以经典的Apriori算法为基础,可以在提出新的支持度后,直接在首次挖掘的基础上进行再一次挖掘。结果表明,它较Apriori算法的实现速度有明显的提高。

When users mine associating rules, they need to change support continuously in order to achieve their results.In this paper,we present a new and fast algorithm for mining associating rules in large database.The algorithm is based on the traditional Apriori.And it can re-mine the database based on the first mining results in light of support changes,