首页 | 本学科首页   官方微博 | 高级检索  
     

决策树算法的系统实现与修剪优化
引用本文:姚家奕,姜海,王秦. 决策树算法的系统实现与修剪优化[J]. 计算机工程与设计, 2002, 23(8): 75-77
作者姓名:姚家奕  姜海  王秦
作者单位:北方交通大学,北京,100044
摘    要:决策树是对分类问题进行深入分析的一种方法,在实际问题中,按算法生成的决策树往往复杂而庞大,令用户难以理解,这就告诉我们在重分类精确性的同时,也要加强对树修剪的研究,以一个决策树算法的程序实现为例,进一步讨论了对树进行修剪优化时可能涉及的问题,目的在于给决策树研究人员提供一个深入和清晰的简化技术视图。

关 键 词:决策树算法 系统实现 修剪优化 机器学习 分类 归纳算法
文章编号:1000-7024(2002)08-0075-03

Realizing and optimizing of decision tree algorithm
YAO Jia -yi,JIANG Hai,WANG Qin. Realizing and optimizing of decision tree algorithm[J]. Computer Engineering and Design, 2002, 23(8): 75-77
Authors:YAO Jia -yi  JIANG Hai  WANG Qin
Abstract:Decision tree is a widely-used solution to classification problems. In many applications, the trees produced are not clear to users due to their size, which tells us that we must notice both accuracy and simplification. Based on an tree-pruning system example , the article further discusses some directions related to pruning the trees, the purpose is to provide researchers with a concise view of pruning technology.
Keywords:decision tree  classification  induction algorithms  pruning algorithms
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号