摘要
研究一个属性的某几个属性值并的权熵之和与该属性单个属性值的权熵之和的关系,从理论上证明一个属性的某几个属性值并的权熵之和不小于该属性单个属性值的权熵之和.为ID3算法的合理性提供理论基础.实验结果证明结论正确.
The relation between the weighted entropy of the union of several attribute values and the sum of the weighted entropy of the single attribute value is studied. The proof is given for the conclusion that the weighted entropy of the union of several attribute values is not less than the sum of the weighted entropy of the single attribute value, and the theoretical foundation for ID3 algorithm is presented. The results of the experiment conform the conclusion.
出处
《保定学院学报》
2008年第4期24-27,共4页
Journal of Baoding University
基金
河北农业大学非生命学科与新兴学科科研发展基金(FSY200739)
关键词
信息熵
ID3算法
决策树
条件属性
决策属性
entropy
ID3 algorithm
decision tree
conditional attributes
decision attributes
