首页> 外文会议>International Conference of Soft Computing and Pattern Recognition >Rough set and CART approaches to mining incomplete data
【24h】

Rough set and CART approaches to mining incomplete data

机译:粗糙集和推车方法挖掘不完整的数据

获取原文

摘要

Many data sets are incomplete, i.e., are affected by missing attribute values. In this paper, we report results of experiments on two approaches to missing attribute values. The first one is based on rough set theory and rule induction, the second one is the CART method that uses surrogate splits for handling missing attribute values and that generates decision trees. As follows from our experiments, both approaches are comparable in terms of an error rate. Thus, for a specific data set the best method of handling missing attribute values should be selected individually.
机译:许多数据集是不完整的,即,受缺少属性值的影响。在本文中,我们报告了两种缺少属性值的方法的实验结果。第一个基于粗糙集理论和规则诱导,第二个是使用代理分裂来处理缺少属性值并且产生决策树的推车方法。如我们实验所遵循的方式,两种方法在错误率方面都是可比的。因此,对于特定数据设置,应单独选择丢失属性值的最佳方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号