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

粗糙集与决策树比较研究
引用本文:翟俊海,张素芳,徐正夫,王熙照.粗糙集与决策树比较研究[J].河北大学学报(自然科学版),2012,32(4):421-428.
作者姓名:翟俊海  张素芳  徐正夫  王熙照
作者单位:1. 河北大学数学与计算机学院,河北省机器学习与计算智能重点实验室,河北保定071002
2. 河北省信息工程学校计算机教研室,河北保定,071000
3. 北京交通大学海滨学院,河北黄骅,061100
基金项目:国家自然科学基金资助项目(61170040);河北省自然科学基金资助项目(F2010000323;F2011201063);河北省高等学校科学技术研究重点项目(ZD2010139);河北大学自然科学基金资助项目(2011-228)
摘    要:粗糙集和决策树都属于归纳学习方法,都可以从一个离散值决策表中抽取出规则.本文从算法过程、计算复杂性、规则个数、泛化能力、稳健性几个方面对粗糙集和决策树进行了比较研究,得出了一些重要结论,能为相关研究提供一些有价值的参考.

关 键 词:粗糙集  决策树  信息熵  约简

Comparative study on rough sets and decision trees
ZHAI Jun-hai , ZHANG Su-fang , XU Zheng-fu , WANG Xi-zhao.Comparative study on rough sets and decision trees[J].Journal of Hebei University (Natural Science Edition),2012,32(4):421-428.
Authors:ZHAI Jun-hai  ZHANG Su-fang  XU Zheng-fu  WANG Xi-zhao
Institution:1(1.Key Lab.of Machine Learning and Computational Intelligence,College of Mathematics and Computer Science,Hebei University,Baoding 071002,China;2.Teaching and Research of Section of Computer,Hebei Information Engineering School,Baoding 071000,China; 3.Haibin College,Beijing Jiaotong University,Huanghua 061100,China)
Abstract:Rough sets and decision trees are both inductive learning methods,and can extract rules from a decision table with discrete values.In this paper,we compare rough sets with decision trees in the following aspects: process of algorithm,computational complexity,number of rules,generalization abilities and robustness.Some important conclusions have been obtained,which can provide valuable reference for further research works
Keywords:rough sets  decision trees  information entropy  reduct
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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