摘要
本文对关联规则的挖掘问题进行了深入研究。在总结现有算法优缺点的基础上,提出了一种新的基于决策树的快速关联规则挖掘算法(RABDT),结合决策树的构造过程,给出了算法的原理和实现步骤,并通过实验对比验证了算法的有效性。
In this paper,the issue of mining association rules is discussed deeply. A new mining algorithm,Rapid Rules Mining Algorithm based on Decision Tree, RABDT is proposed, after summarizing the advantage and disadvantage of current mining association rules algorithms. The principle and steps of RABDT are given with constructing a decision tree,and a contrast test shows that RABDT is far rapid and effective.
出处
《计算机科学》
CSCD
北大核心
2008年第7期252-254,共3页
Computer Science
关键词
数据挖掘
关联规则
决策树
算法
Ddata mining,Association rules,Decision tree,Algorithm