摘要
在数据挖掘中,决策树方法是一个重点研究方向。ID3方法是著名的决策树算法,在这种算法中,互信息的计算依赖于特征值数目较多的特征,这样不太合理。为此,从离散度的角度,对ID3算法进行改进,通过2种算法的对比实验,证明利用改进后的算法挖掘分类规则,不仅提高了分类的正确率,而且非常高效。
In data mining, decision tree algorithm is a key research direction. ID3 method is a famous decision tree algorithm,among this kind of algorithm, the calculation of information gain depends on the characteristic of characteristic value more in figure,it is not so very rational For this reason, the article improves ID3 algorithm in terms of dispersed degree, through the contrast experiment of two kinds of algorithms, proves that utilizes the algorithm after improving to excavate the categorized rule, not only has improved the correct rate classified, but also very high - efficient.
出处
《现代电子技术》
2006年第12期106-108,共3页
Modern Electronics Technique
关键词
决策树
离散度
ID3算法
数据挖掘
decision tree
dispersed degree
ID3 algorithm
data mining
