摘要
提出了一种从大型数据库中挖掘关联规则的快速算法 .该算法以经典的 Apriori和 DHP算法为基础 ,提出了中间检查点、等价项目类等概念 ,并对 Apriori中的 Apriori- gen算法进行了改进 .结果表明 ,它较
This paper provided a fast algorithm for mining associating rules in large database. Based on the traditional Apriori and DHP, this algorithm not only puts forward some new concepts such as the equivalent item set and check point, but also improves the Apriori gen in Apriori algorithm. The experimental results show that this algorithm outperforms Apriori.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
2002年第4期555-558,共4页
Journal of Shanghai Jiaotong University
