首页 | 本学科首页   官方微博 | 高级检索  
     

基于信息熵的粗糙集连续属性离散化算法
引用本文:谢宏,程浩忠,牛东晓. 基于信息熵的粗糙集连续属性离散化算法[J]. 计算机学报, 2005, 28(9): 1570-1574
作者姓名:谢宏  程浩忠  牛东晓
作者单位:1. 上海海事大学电子工程系,上海,200135
2. 上海交通大学电气工程系,上海,200135
3. 华北电力大学经济管理系,保定,071003
基金项目:本课题得到国家自然科学基金(50077007)资助.
摘    要:该文提出了一种新的粗糙集连续属性离散化算法.首先对每一个候选断点定义了信息熵,以此作为对断点重要性的量度,在此基础上给出了断点选择的粗糙集连续属性离散化算法.最后采用多组数据对此算法的性能进行了检验,并与其它算法做了对比实验.实验结果表明此算法是有效的,而且当候选断点个数增多时仍有很高的计算效率.

关 键 词:信息熵 粗糙集 连续属性 离散化
收稿时间:2003-01-03
修稿时间:2003-01-032005-05-26

Discretization of Continuous Attributes in Rough Set Theory Based on Information Entropy
XIE Hong,CHENG Hao-Zhong,NIU Dong-Xiao. Discretization of Continuous Attributes in Rough Set Theory Based on Information Entropy[J]. Chinese Journal of Computers, 2005, 28(9): 1570-1574
Authors:XIE Hong  CHENG Hao-Zhong  NIU Dong-Xiao
Abstract:In this paper a new discretization algorithm of continue attributes in rough set is offered. Firstly, a information entropy is defined for every candidate cut point and treated as a measurement of importance. On the basis of that, a discretization algorithm of continue attributes in rough set for selecting cut points is illustrated. Finally, a group of data set is applied to test the performance of the algorithm and the experiment result is compared with other discretization algorithm. The experiment result shows that the algorithm is effective, and keeps a high computing efficiency when the number of candidate cut point increase.
Keywords:information entropy   rough set    continuous attributes   discretization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号