计算机应用与软件Issue(3)：259-262,4.DOI:10.3969/j.issn.1000-386x.2014.03.068
一种基于粗糙集和信息熵理论的属性离散化算法
AN ATTRIBUTE DISCRETISATION ALGORITHM BASED ON ROUGH SET AND INFORMATION ENTROPY THEORY
摘要
Abstract
After analysing and studying the necessity of continuous attributes processing in C5 algorithm and the shortcomings of discretisation method in C5 algorithm,we propose to adopt a discretisation method based on rough set theory-information entropy-discernible matrix discretisation (RSIEDM).By making use of the above three,the method can more reasonably and accurately discretise the continuous attributes,and enables the created decision tree to have better accuracy.Applying the method to optimising the statistics of lightning disaster and evaluating the losses of lightning disaster,the algorithm achieves desirable result.关键词
决策树/离散化/粗糙集/信息熵/可辨识矩阵Key words
Decision tree/Discretisation/Rough set/Information entropy/Discernible matrix分类
信息技术与安全科学引用本文复制引用
侯荣涛,史鑫明,路郁..一种基于粗糙集和信息熵理论的属性离散化算法[J].计算机应用与软件,2014,(3):259-262,4.基金项目
天津自然科学基金项目（10JCZDJC23400）；2012年度普通高校研究生科研创新计划项目（CXLX12＿0515）。 （）
