| 基于熵的决策可信度分析 |
| |
| 引用本文： | 刘利东. 基于熵的决策可信度分析[J]. 德州学院学报, 2003, 19(4): 65-69 |
| |
| 作者姓名： | 刘利东 |
| |
| 作者单位： | 德州学院计算机系,山东德州,253023 |
| |
| 摘 要： | 从分类的角度进一步阐述了信息熵的概念，使得利用信息熵的方法构造决策树有了更加坚实的数学基础，研究了信息熵与决策可信度的关系，给出了利用信息熵计算决策最大和最小可信度简单、直观易操作的算法，在期望信息熵较小时计算得出的最大和最小可信度是非常接近的，因此可以用它来做估计决策可信度的依据，实验结果也表明计算的结果和实际的决策可信度是非常接近的。
|
| 关 键 词： | 信息熵 决策树 数据挖掘 ID3算法 |
| 文章编号： | 1004-9444(2003)04-0065-05 |
| 修稿时间： | 2002-11-27 |
Analysis of the credible degree of the decision based on information entropy |
| |
| LIU Li - dong. Analysis of the credible degree of the decision based on information entropy[J]. Journal of Dezhou University, 2003, 19(4): 65-69 |
| |
| Authors: | LIU Li - dong |
| |
| Abstract: | The ID3 algorithm is a valid approach to construct decision trees. It attempts to gain as much information as possible when adding a new level to the tree. In this paper, we discussed the relationship between information entropy and the credible degree of the decision. We also gave a algorithm to calculate the approximation of the credible degree. This is useful when constructing normal rules. |
| |
| Keywords: | information entropy decision tree data mining ID3 algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
