决策树ID3算法的分析与优化  

Analysis and Optimization of ID3 Decision Tree Algorithm

作　　者：李瑞[1] 许旭睿 

机构地区：[1]大连交通大学软件学院,辽宁大连116028

出　　处：《大连交通大学学报》2015年第2期91-95,共5页Journal of Dalian Jiaotong University

基　　金：辽宁省教育厅科学研究计划资助项目(L2012163)

摘　　要：对ID3算法的基本概念和原理以及其分支策略和构造过程进行了详细阐述,针对ID3算法倾向于选择取值较多的属性的缺点,引进属性偏向阈和信息增益率对其做了改进,并利用凸函数的性质简化了ID3算法中信息增益的计算.通过实验对改进前后的算法进行了比较,实验表明,改进后的算法是有效的.The basic concepts and principles of ID3 algorithm and its branching strategy and construction process are elaborated. For the shortcoming that ID3 algorithm tends to choose attribute with many values, at- tribution deflection threshold and information gain ratio were introduced to improve ID3 algorithm, and the properties of convex function was used to simplify the information gain calculation in the ID3 algorithm. By comparing experiments, the results show that the improved algorithm is effective.

关 键 词：决策树 ID3算法 凸函数 信息增益率 属性偏向阈 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]