首页 | 官方网站   微博 | 高级检索  
     

基于ROUGH集的决策树测试属性选择方法
引用本文:程玉胜,任广永.基于ROUGH集的决策树测试属性选择方法[J].安庆师范学院学报(自然科学版),2004,10(4):89-92.
作者姓名:程玉胜  任广永
作者单位:安庆师范学院,计算机系,安徽,安庆,246011;安庆师范学院,计算机系,安徽,安庆,246011
基金项目:安徽省教育厅科研项目,安徽省高校青年教师科研项目
摘    要:测试属性的选择直接影响到决策树中结点的个数甚至是深度,因此如何选择测试属性是研究的一个热点。本文主要介绍了粗集理论的方法。通过比较我们会发现,在单变量决策树的构造上,粗集理论中属性重要性的方法计算量较小,而多变量决策树充分考虑了条件属性间的相关性,因此通过求解信息系统的相对核从而减少决策树结点的个数。

关 键 词:决策树  决策信息系统  信息增益  粗集
文章编号:1007-4260(2004)04-0089-04

How to Choose Test Attributes in a Decision Tree Based on Rough Set
CHENG Yu-sheng,REN Guang-yong.How to Choose Test Attributes in a Decision Tree Based on Rough Set[J].Journal of Anqing Teachers College(Natural Science Edition),2004,10(4):89-92.
Authors:CHENG Yu-sheng  REN Guang-yong
Abstract:How to choose test attributes, plays a role in constructing the decision tree. Therefore it has become an attractive research direction. Now there are many different methods to solve it. In this paper the two basic methods are introduced such as information entropy and rough sets. Comparing those methods, the method of the important attributes in rough sets is understood easily and decreases the computation in the way of constructing the single vary decision tree. But the relative of the condition attributes is ignored. On the contrary, the core(s) is found at first using rough sets method by considering the relation of condition attributes. The method of the many vary decision tree puts the core(s) into the root node, so it reduces the nodes in a tree.
Keywords:decision tree  decision information system  information entropy  rough sets
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号