| 基于相对熵的决策树生成方法 |
| |
| 引用本文： | 李雄英,桂现才. 基于相对熵的决策树生成方法[J]. 数字社区&智能家居, 2009, 0(3) |
| |
| 作者姓名： | 李雄英 桂现才 |
| |
| 作者单位： | 湛江师范学院数学与计算科学学院; |
| |
| 摘 要： | 决策树是一种重要的数据分类方法,在构造决策树的过程中,测试属性的选择直接影响到决策树中结点的个数和深度,基于相对熵的概念提出了一种新的决策树构造方法。实例分析的结果表明:在决策树的构造上,粗糙集理论中相对熵的方法计算量较小,构造的决策树比经典ID3,C4.5算法简洁,并且具有较高的分类精度。
|
| 关 键 词： | 决策树 粗糙集 信息系统 相对熵 |
Decision Trees Generation Method Based on Relative Entropy |
| |
| LI Xiong-ying,GUI Xian-cai. Decision Trees Generation Method Based on Relative Entropy[J]. Digital Community & Smart Home, 2009, 0(3) |
| |
| Authors: | LI Xiong-ying GUI Xian-cai |
| |
| Affiliation: | Mathematics and Computational Science School;Zhanjiang Normal College;Zhanjiang 524048;China |
| |
| Abstract: | Decision Tree is one of the most important method for datamining. In the process of constructing a decision tree, the choice of testing attribute will touch the depth and nodes of decision tree. A new decision trees generation method is presented based on relative en- tropy. The experiments show that, compared with the ID3,C4.5 method, the new method has less compute capacity and constructed deci- sion tree is concision with higher classify precision. |
| |
| Keywords: | decision tree rough set relative entropy |
| 本文献已被 CNKI 等数据库收录！ |
|
