基于信息论的连续属性离散化  

Discretization of Continuous-valued Attributes Using Information Theory

作　　者：徐如燕[1] 鲁汉榕[2] 郭齐胜 

机构地区：[1]装甲兵工程学院,北京100072 [2]空军雷达学院指挥自动化工程系,湖北武汉430019

出　　处：《空军雷达学院学报》2001年第2期20-23,共4页Journal of Air Force Radar Academy

摘　　要：使用信息论的方法进行连续属性的离散化。引入Ｈｅｌｌｉｎｇｅｒ偏差ＨＤ （Ｈｅｌｌｉｎｇｅｒ　Ｄｉ－ｖｅｒｇｅｎｃｅ）作为每个区间对决策的信息量度量，从而定义切分点的信息熵，最终的离散化结果是使各区间的信息量尽可能平均。分析了ＨＤ度量在两种离散化方法中的作用，说明它在划分算法中运用比较理想，而在归并算法中则有局限。We adopt the method of information theory in the discretization of continuous numerical va- lues. We introduce Hellinger divergence as the measure of amount of information that each potential interval gives to the decision attributes. Then the entropy of cutpoint is defined. Our aim is to discretize numeric values so that the information content of each interval is as equal as possible. We analyze the act of Hellinger divergence in both discretization algorithms of merging and splitting, and draw a conclusion that it is a fairly ideal measure in the latter and has some limitations in the former.

关 键 词：连续属性离散化 算法 归并 度量 信息论 信息熵 切分 离散化方法 平均 区间 

分 类 号：TN911[电子电信—通信与信息系统] TP182[电子电信—信息与通信工程]