首页> 外文会议>International conference on hybrid artificial intelligent systems >Credal Decision Trees to Classify Noisy Data Sets
【24h】

Credal Decision Trees to Classify Noisy Data Sets

机译:用于对嘈杂数据集进行分类的Credal决策树

获取原文

摘要

Credal Decision Trees (CDTs) are algorithms to design classifiers based on imprecise probabilities and uncertainty measures. C4.5 and CDT procedures are combined in this paper. The new algorithm builds trees for solving classification problems assuming that the training set is not fully reliable. This algorithm is especially suitable to classify noisy data sets. This is shown in the experiments.
机译:Credal决策树(CDT)是基于不精确概率和不确定性度量设计分类器的算法。本文将C4.5和CDT程序结合在一起。假设训练集不完全可靠,该新算法将构建用于解决分类问题的树。该算法特别适合对噪声数据集进行分类。实验中显示了这一点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号