摘要
针对CMAR算法存在的不足,提出了层次频繁模式树的概念,并在此基础上实现了关联分类数据挖掘算法.实验数据表明,该方法比CMAR算法具有更高的效率与数据库覆盖面.
Aiming at the shortcomings of CMAR algorithm, proposed a hierarchical frequent pattern tree concept, and on the basis of the associative classification algorithm of data mining. Experimental data show that, this method than the CMAR algorithm has higher efficiency and database coverage.
出处
《济宁学院学报》
2011年第6期76-78,共3页
Journal of Jining University
关键词
数据挖掘
关联分类规则
层次频繁模式树
data mining
association classification roles
hierarchical frequent pattern tree