一种基于限制的关联规则数据开采的算法

An Algorithm for Mining Constraint based Association Rules

针对海量数据库开采时 ,现有的关联规则算法效率非常低下的问题 ,提出一种附加最小保证度的限制 ,并在此基础上提出一种新的开采算法 ,可减少频繁项目集的数量 。

Most of existing algorithms are not efficient and produce many useless rules when a data set is very large. In order to solve this problem, the authors propose the notion of minimum guarantee. A new algorithm is presented which can greatly decrease the number of frequent itemsets and reduce both I/O time and CPU time remarkably.