基于有序决策树的改进归纳算法  

An improved induction algorithm based on ordinal decision tree

作　　者：潘盼[1] 王熙照[2] 翟俊海[2] 

机构地区：[1]河北大学数学与计算机学院,河北保定071002 [2]河北省机器学习与计算智能重点实验室,河北保定071002

出　　处：《山东大学学报（工学版）》2014年第1期41-44,共4页Journal of Shandong University（Engineering Science）

基　　金：国家自然科学基金资助项目(61170040);河北省自然科学基金资助项目(F2013201110;F2013201220);河北大学自然科学基金资助项目(2011-228043)

摘　　要：基于构建有序决策树,提出了一种新的归纳算法。该算法选择的扩展属性不仅和类的有序互信息值最大,而且要求和同一分支上已被用过的条件属性的有序互信息值最小。实验结果表明,考虑了条件属性之间的相关性后,可避免同一条件属性的重复选择,真正体现了条件属性和决策属性之间的有序互信息,与已有的算法相比,提高了测试精度。An improved ordinal decision tree algorithm was proposed.The extended attributes selected with the pro-posed algorithm maximized the ranking mutual information between the candidate attributes and the decision attribute, and also minimized the ranking mutual information between the candidate attributes and the selected conditional attrib-utes on the same branch.The experimental results showed that the correlation to be taken account among the conditional attributes could avoid to selecte the same one, and the ideas of the proposed method could really reflect the nature of the ranking mutual information.The proposed algorithm could improve the test accuracy compared with the existing algo-rithms.

关 键 词：有序互信息 有序分类 有序信息熵 属性相关 决策树 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]