• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2005, Vol. 27 ›› Issue (10): 69-70.

• 论文 • 上一篇    下一篇

基于RST的决策树生成与剪枝方法

王名扬 卫金茂 伊卫国   

  • 出版日期:2005-10-01 发布日期:2010-06-24

  • Online:2005-10-01 Published:2010-06-24

摘要:

基于粗糙集理论构建决策树的过程中,通过计算各条件属性相对某分类的边界,选取边界最小的属性作为当前分支的节点,但此方法在多值分类情况下不能直接应用。为此,本文利用明确区的概念作为选取属性的标准,对各候选条件属性,选取相对于整个结果属性的明确区最大的属性作为当前分支的节点。并且基于明确区的概念,提出了一种新
 新的对决策树进行剪枝的方法,通过一个实例说明该剪枝方法是简洁有效的.

关键词: 明确区 非明确区 明确度 深度拟合率

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 e  xplicit region based on RST which will be used as the eriteria 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.

Key words: (explicit region, implicit region, explicit degree, depth-fitting ratio)