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

基于粗糙集技术的决策树归纳
引用本文:翟俊海,王熙照,张沧生.基于粗糙集技术的决策树归纳[J].计算机工程与应用,2009,45(18):45-47.
作者姓名:翟俊海  王熙照  张沧生
作者单位:1. 河北大学,数学与计算机学院,河北省机器学习与计算智能重点实验室,河北,保定,071002
2. 河北大学,计算中心,河北,保定,071002
基金项目:河北省自然科学基金,河北省应用基础研究重点项目,河北省教育厅首批百名优秀人才支持计划 
摘    要:ID3算法是一种典型的决策树归纳算法,它以信息增益作为选择扩展属性根结点的标准,并递归地生成决策树。但ID3算法倾向于选取属性取值较多的属性作为根结点,而且它假设训练集中各类别样例的比例应与实际问题领域里各类别样例的比例相同。提出一种新的基于粗糙集技术的决策树归纳算法,它是一种完全数据驱动的归纳算法,可以克服ID3算法的上述不足。

关 键 词:决策树  ID3算法  粗糙集  上近似  下近似
收稿时间:2008-12-15
修稿时间:2009-2-18  

Induction of decision tree based on rough sets technique
ZHAI Jun-hai,WANG Xi-zhao,ZHANG Cang-sheng.Induction of decision tree based on rough sets technique[J].Computer Engineering and Applications,2009,45(18):45-47.
Authors:ZHAI Jun-hai  WANG Xi-zhao  ZHANG Cang-sheng
Affiliation:1.Key Lab of Machine Learning and Computational Intelligence,College of Mathematics and Computer Science,Hebei University,Baoding,Hebei 071002,China 2.Computing Center,Hebei University,Baoding,Hebei 071002,China
Abstract:The ID3 algorithm is a typical decision tree induction method.Information gain measure is utilized to select optimal attributes with minimum entropy.Decision tree is recursively generated.However,there is natural bias in the information gain measure that favors attributes with many values over those with few values.Moreover,it assumes that the distribution of all classes’ instances in the training set is same with the real problems.This paper presents a novel decision tree induction method,which is purely driven by the data used,and can overcome the drawbacks mentioned above.
Keywords:decision tree  ID3 algorithm  rough sets  upper approximations  lower approximations
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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