节点文献
决策树ID3算法的改进
An Improved ID3 Algorithm of Decision Trees
【摘要】 本文根据ID3算法中信息增益计算原理的特点,利用数学上等价无穷小的性质提出一种新的改进的ID3算法,减少了信息增益的计算量,进而提高ID3算法中信息增益的计算效率。与原ID3算法相比,改进的ID3算法在构造决策树时具有相同的准确率和更高的计算速度。
【Abstract】 According to the gain information in the ID3 algorithm calculation principle,we use the mathematical equivalence of the infinitesimal nature of a newly improved ID3 algorithm to reduce the amount of computation gain information,and improve the information gain computational efficiency in the ID3 algorithm.Compared with the original ID3 algorithm,the Improved ID3 algorithm has the same rate of accuracy and higher speed in the decision tree structure.
【关键词】 决策树;
ID3算法;
信息增益;
等价无穷小;
【Key words】 decision tree; ID3 algorithm; information gain; equivalent infinitesimal;
【Key words】 decision tree; ID3 algorithm; information gain; equivalent infinitesimal;
【基金】 2007年娄底职业技术学院科研资助项目(07ZF021)
- 【文献出处】 计算机工程与科学 ,Computer Engineering & Science , 编辑部邮箱 ,2009年06期
- 【分类号】TP311.13
- 【被引频次】76
- 【下载频次】912