节点文献
高泛化能力的变精度粗糙集的决策树算法
Decision tree algorithm using variable precision rough set
【摘要】 现有基于变精度粗糙集模型的决策树生成算法具有如下不足:有些叶子结点上覆盖的实例数太少,导致这些叶子结点的泛化能力太小而没有意义;不能很好地处理不一致的实例集.为解决上述问题,引入属性是否具有决策类这一概念,较好地避免了决策树的过剩生长,使得生成的决策树有较好的泛化能力.给出新的终止条件,即时地终止不一致实例集的生长.在此基础上,给出新的终止条,提出了一种新的基于变精度粗糙集的决策树生成算法.用一实例说明了新算法的效率得到提高.
【Abstract】 The decision tree generation algorithms based on the variable precision rough set model have the following shortcomings.Firstly,some leaf nodes may cover few instances.Thus the generalization ability of these nodes is not so high enough to make sense.Secondly,inconsistent instances can not be processed properly.To deal with the above problems,the definition of decision class was first introduced to solve the problem of over-expanding of decision tree properly.Therefore the ability of generalization of decision tree was also improved.Then a new method,which could stop the expansion of inconsistent instances in time,was also proposed.At the same time,a new decision tree generation algorithm based on variable precision rough set was presented.Finally,an example was used to illustrate the advantages of this new algorithm.
【Key words】 decision tree; algorithm; variable precision rough set; information gain; inconsistent cases set;
- 【文献出处】 华中科技大学学报(自然科学版) ,Journal of Huazhong University of Science and Technology(Nature Science Edition) , 编辑部邮箱 ,2008年08期
- 【分类号】TP18
- 【被引频次】2
- 【下载频次】195