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

基于RST的决策树生成与剪枝方法
引用本文:王名扬,卫金茂,伊卫国.基于RST的决策树生成与剪枝方法[J].计算机工程与科学,2005,27(10):69-70.
作者姓名:王名扬  卫金茂  伊卫国
作者单位:东北师范大学计算智能研究所,吉林,长春,130024
摘    要:基于粗糙集理论构建决策树的过程中,通过计算各条件属性相对某分类的边界,选取边界最小的属性作为当前分支的节点,但此方法在多值分类情况下不能直接应用。为此,本文利用明确区的概念作为选取属性的标准,对各候选条件属性,选取相对于整个结果属性的明确区最大的属性作为当前分支的节点。并且基于明确区的概念,提出了一种新
新的对决策树进行剪枝的方法,通过一个实例说明该剪枝方法是简洁有效的.

关 键 词:明确区  非明确区  明确度  深度拟合率
文章编号:1007-130X(2005)10-0069-02
修稿时间:2004年1月7日

RST-Based Method for Constructing and Pruning Decision Trees
Wang Ming-yang,WEI Jin-mao,YI Wei-guo.RST-Based Method for Constructing and Pruning Decision Trees[J].Computer Engineering & Science,2005,27(10):69-70.
Authors:Wang Ming-yang  WEI Jin-mao  YI Wei-guo
Abstract:In the process of constructing decision trees based on RST,the common method is to calculate the size of the boundary for every conditional attribute relative to a decision classification and then choose the attribute with the minimum size of the boundary as the current node of the tree.However,this method only aims to solve the problem of two-valued classification while invalid to the multi-valued one.In this paper,we propose a new concept of explicit region based on RST which will be used as the criteria for selecting attributes.Among all the candidate attributes,the attribute which has the largest explicit region will be figured out as the current node according to the whole decision classification. Furthermore,we also propose a new pruning strategy based on explicit region and the method proves to be brief and effective.
Keywords:explicit region  implicit region  explicit degree  depth-fitting ratio
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与科学》浏览原始摘要信息
点击此处可从《计算机工程与科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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