| 注册
首页|期刊导航|计算机与数字工程|一种改进的决策树后剪枝算法磁

一种改进的决策树后剪枝算法磁

郑伟 马楠

计算机与数字工程Issue(6):960-966,971,8.
计算机与数字工程Issue(6):960-966,971,8.DOI:10.3969/j.issn1672-9722.2015.06.005

一种改进的决策树后剪枝算法磁

An Improved Post-Pruning Algorithm for Decision Tree

郑伟 1马楠1

作者信息

  • 1. 中国石油规划总院 北京 100083
  • 折叠

摘要

Abstract

The classification accuracy of a decision tree would be lower when the depth and the nodes exceed a certain size .So it's necessary to reduce the scale of decision tree by using a pruning algorithm and ensure the accuracy of classifica‐tion at the same time .To solve this problem ,a kind of post‐pruning strategy which evenly considers classification accuracy , classification stability ,and the scale of decision tree is proposed on the basis of in‐depth study of the existing decision tree pruning algorithm .Experimental results show that this improved post‐pruning algorithm can effectively reduce the size of the decision tree ,ensure the accuracy and stability ,and make the final model more compact .

关键词

分类算法/决策树/剪枝算法

Key words

classification algorithm/decision tree/pruning algorithm

分类

信息技术与安全科学

引用本文复制引用

郑伟,马楠..一种改进的决策树后剪枝算法磁[J].计算机与数字工程,2015,(6):960-966,971,8.

计算机与数字工程

OACSTPCD

1672-9722

访问量0
|
下载量0
段落导航相关论文