基于粗糙集的ID3决策树算法改进
Improved ID3 decision tree algorithm based on rough set
-
摘要: 针对ID3等传统的决策树算法通常采用单个属性作为分枝判断依据,导致生成树的规模大、形成的规则较难理解的问题,提出了一种以多变量作为结点属性判断条件的算法.该算法利用粗糙集中属性依赖的特性,选择信息系统中条件属性相对决策属性的核属性作为多变量结点属性,使用相对泛化的概念辅助分枝过程,进而生成多变量决策树.通过实例分析与传统的ID3算法进行比较,证明了改进算法的高效性.Abstract: The traditional decision tree algorithms such as ID3 usually uses a single attribute as the basis of branching judgment.The scale of the tree generated by ID3 is very large and rules formed are difficult to understand.Aiming at the problems described above, an algorithm was proposed using multi-variable as the judging conditions of node attributes.By using the property of attribute dependency in rough set and choosing nuclear properties of condition attributes relative to decision attributes in the information system as multi-variable node attributes,the algorithm used the concept of relative generalization to aid the branching process and generated a multi-variable decision tree.Through the analysis of example and by comparing with the conventional ID3 algorithm, the high efficiency of the improved algorithm was verified.
-
Key words:
- rough set /
- ID3 algorithm /
- decision tree /
- relative generalization /
- equivalent relationship
-
-
[1]
徐晓,翟敬梅,刘海涛.制造决策的知识融合粗糙集模型[J].华南理工大学学报:自然科学版,2011,39(8):36.
-
[2]
黄爱辉,陈湘涛.决策树ID3算法的改进[J].计算机工程与科学,2009,31(6):109.
-
[3]
朱颢东,钟勇.ID3算法的优化[J].华中科技大学学报:自然科学版,2010,38(5):9.
-
[4]
费洪晓,胡琳.一种粗糙集-决策树结合的入侵检测方法[J].计算机工程与应用,2012(22):124.
-
[5]
戴小廷,陈荣思,肖冰.基于信息熵的决策树挖掘算法在智能电力营销中的应用[J].郑州轻工业学院学报:自然科学版,2012,27(3):49.
-
[6]
苗夺谦,王珏.基于粗糙集的多变量决策树构造方法[J].软件学报,1997(6):425.
-
[7]
王飞,王卓,曾姚.基于变精度粗糙集的决策树构造改进算法[J].计算机与数字工程,2013(3):337.
-
[8]
翟俊海,翟梦尧,李胜杰.基于相容粗糙集技术的连续值属性决策树归纳[J].计算机科学,2012(11):183.
-
[9]
王永梅,胡学钢.决策树中ID3算法的研究[J].安徽大学学报:自然科学版,2011(3):71.
-
[10]
卢铮松.研究生奖学金的决策树分类数据挖掘研究[J].计算机工程与应用,2012(26):139.
-
[1]
-
点击查看大图
计量
- PDF下载量: 27
- 文章访问数: 850
- 引证文献数: 0
下载:
