摘要
当使用关联规则进行数据挖掘时,使用者为了达到一定的挖掘效果,经常需要不断地改变关联规则的支持度阈值(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.
出处
《机械制造与自动化》
2005年第2期75-77,共3页
Machine Building & Automation
基金
江苏省青年社科基金资助。
