首页> 外文会议>International Conference on Computer Science and Service System;CSSS 2012 >Performance Analysis between Different Decision Trees for Uncertain Data
【24h】

Performance Analysis between Different Decision Trees for Uncertain Data

机译:不确定数据的不同决策树之间的性能分析

获取原文

摘要

In order to compare the classification accuracies and performance differences between traditional and probability-based decision tree classifiers, and come to understand those algorithms, which aim to improve construction efficiency of probability-based decision trees, mentioned in 'Decisions Trees for Uncertain Data', this paper tested several algorithms, named AVG, UDT, UDT-BP, UDT-LP, UDT-GP, and UDT-ES respectively which based on the source codes of UDT program version 0.9. Extensive experiments have been conducted and the results show that: 1) Probability-based classifiers are more accurate than those using value averages. 2) Comparing with other pruning algorithms, UDTES algorithm performs the best when pruning probability-based decision trees.
机译:为了比较传统决策树分类器和基于概率的决策树分类器之间的分类准确性和性能差异,并了解这些算法,旨在提高“不确定数据的决策树”中提到的基于概率的决策树的构造效率,本文基于UDT程序版本0.9的源代码分别测试了几种算法,分别为AVG,UDT,UDT-BP,UDT-LP,UDT-GP和UDT-ES。已经进行了广泛的实验,结果表明:1)基于概率的分类器比使用值平均值的分类器更准确。 2)与其他修剪算法相比,UDTES算法在修剪基于概率的决策树时表现最佳。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号