【24h】

A tree-based algorithm for attribute selection

机译:一种基于树的属性选择算法

获取原文
获取原文并翻译 | 示例
           

摘要

This paper presents an improved version of a decision tree-based filter algorithm for attribute selection. This algorithm can be seen as a pre-processing step of induction algorithms of machine learning and data mining tasks. The filter was evaluated based on thirty medical datasets considering its execution time, data compression ability and AUC (Area Under ROC Curve) performance. On average, our filter was faster than Relief-F but slower than both CFS and Gain Ratio. However for low-density (high-dimensional) datasets, our approach selected less than 2% of all attributes at the same time that it did not produce performance degradation during its further evaluation based on five different machine learning algorithms.
机译:本文提出了一种改进的基于树木滤波器算法的改进版本,用于属性选择。 该算法可以看作是机器学习和数据挖掘任务的感应算法的预处理步骤。 考虑到其执行时间,数据压缩能力和AUC(ROC曲线区域下的区域)性能,基于30个医疗数据集进行评估滤波器。 平均而言,我们的过滤器比CFS-F更快,但比CFS和增益比慢。 然而,对于低密度(高维)数据集,我们的方法在基于五种不同的机器学习算法的进一步评估期间,我们的方法在所有属性的同时选择少于2%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号