摘要
决策树是数据挖掘任务中分类的常用方法,ID3算法是经典的决策树生成算法,它的核心是通过计算各个属性的信息熵来确定最好的分枝结点.给出一种用粗集的方法计算信息熵,应用ID3算法来生成决策树.
Decision Iree is a usual method of elassification in data mining, and ID3 algorithm is the classical melhod of deeisiun trees production, which decides the best branch node through calculating entropy of each altribute. A method based on Rough Sel will be presented, to calculate the entropy for the decision trees production.
出处
《湘潭大学自然科学学报》
CAS
CSCD
北大核心
2006年第1期33-36,共4页
Natural Science Journal of Xiangtan University
基金
湖南省教育厅资助项目(04C656)
