基于信息熵的决策属性分类挖掘算法及应用  

Algorithm and Application of the Decision Attribute Classification Based on Information Entropy

作　　者：舒红平[1] 游志胜[1] 蒋建民[2] 

机构地区：[1]四川大学计算机学院 [2]重庆工商大学计算机科学与信息工程学院,重庆400020

出　　处：《计算机工程与应用》2004年第1期186-189,共4页Computer Engineering and Applications

摘　　要：在利用判定树进行分类挖掘时,需事先知道属性的分类。对不具体的或未知的属性分类,利用“高类聚、低耦合”原理对属性进行最优分类。在属性分类的基础上,利用基于信息熵的属性期望信息及对应的信息增益理论选择最佳分类决策属性,并按最佳分类决策属性引出分枝形成判定树。该文对属性的最优分类理论及算法进行了描述,并讨论了选择最佳决策属性构造判定树的算法,结合具体应用实例进行了验证并构造了判定树。In order to class if y a sample by decision tree,it is necessary to know the classification of attri bute in advance.To the unspecific or unknown attribute classification,you may utilize“High kind gathers,Low coupling”principle to carry on the optimum clas sification to attribute.On the basis of what attribute is classified,based on entropy of the information you can utilize attribute expected information and co rresponding information gain theory to choose the best classified decision attri bute,and according to the best classification decision attribute draw branch,a decision tree is constructed.In this paper,optimum classification theory and algorithm to attribute are described,and the algorithm on how to choose best de cision attribute to construct a decision tree is discussed.At the end,combini ng a concrete example,a decision tree is verified and constructed.

关 键 词：属性 分类 数据挖掘 信息熵 判定树 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]