首页> 中文期刊> 《电子科技大学学报》 >基于频繁闭项集的新关联分类算法ACCF

基于频繁闭项集的新关联分类算法ACCF

             

摘要

A new associative classification method named ACCF is presented based on the closed frequent itemsets. This method first mines all closed frequent itemsets and the candidate class association rules (CARs), and then constructs classifier based the selected CARs from the candidate CARS. The new instances are finally classified by a new way. Our theoretical analysis and substantial experiments on 18 datasets from UCI repository of machine learning databases show that ACCF is highly effective at classification of various kinds of datasets. Compared with the typical associative classification algorithms, ACCF can mine much less CARs and has higher average classification accuracy.%提出了基于频繁闭项集的新关联分类算法ACCF.ACCF首先挖掘出所有频繁闭项集(CFIs)和候选分类关联规则,然后从候选分类关联规则中产生和筛选出若干规则,并用其构建分类器;在分类应用时,采用了一种新的匹配方式对分类实例进行分类,通过理论分析和对18个UCI公共数据集的实验结果表明,ACCF不仅能挖掘出高质量且不丢失信息的关联分类规则,而且大大减少了关联分类规则的数量,在分类准确率上也比现有的关联分类典型算法更高.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号