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

一种新的基于决策熵的决策表约简方法
引用本文:徐久成,孙林.一种新的基于决策熵的决策表约简方法[J].重庆邮电大学学报(自然科学版),2009,21(4):479-483.
作者姓名:徐久成  孙林
作者单位:河南师范大学计算机与信息技术学院,河南,新乡,453007
基金项目:国家自然科学基金,河南省高等学校新世纪优秀人才支持计划 
摘    要:分析了在知识约简过程中经典粗糙集理论决策表知识约简方法的不足.以知识粗糙熵为基础,将一致和不一致对象分开,提出决策熵的概念及其属性重要性,在此基础上给出约简的判定定理;然后以条件属性子集的决策熵来度量其对决策分类的重要性,提出一种新的知识约简启发式方法.理论分析和实验结果表明,基于决策熵的属性重要性是一种更有效的启发式信息,该方法时间复杂度较低,有助于搜索最小或次优约简.

关 键 词:粗糙集  决策表  决策熵  知识约简
收稿时间:4/6/2009 12:00:00 AM

New reduction method based on decision information entropy in decision table
XU Jiu-cheng,SUN Lin.New reduction method based on decision information entropy in decision table[J].Journal of Chongqing University of Posts and Telecommunications,2009,21(4):479-483.
Authors:XU Jiu-cheng  SUN Lin
Institution:College of Computer and Information Technology, Henan Normal University, Xinxiang 453007, P. R. China
Abstract:In decision table, the disadvantages of classical rough reduction algorithm were analyzed. Based on the recent rough entropy of knowledge, the new decision information entropy was proposed with separating consistent objects from inconsistent objects, and the new significance of an attribute was defined. The judgment theorem based on this entropy was obtained with respect to knowledge reduction. Condition attributes were considered to estimate the significance for decision classes, and a heuristic algorithm was proposed. Theoretical analysis shows that the proposed heuristic information was better and more efficient than the others, and experimental results prove the validity of the heuristic algorithm in searching the minimal or optimal reduction.
Keywords:rough set  decision table  decision information entropy  knowledge reduction
本文献已被 万方数据 等数据库收录!
点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《重庆邮电大学学报(自然科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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