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

关于决策表约简的CEBARKNC算法改进
引用本文:李明,黄文涛,刘智云.关于决策表约简的CEBARKNC算法改进[J].计算机应用,2006,26(4):864-866.
作者姓名:李明  黄文涛  刘智云
作者单位:兰州理工大学,计算机与通信学院,甘肃,兰州,730050
摘    要:CEBARKNC算法是基于条件信息熵的决策表约简算法,但是该算法对于某些决策表的约简是不完全的。通过对CEBARKNC算法的分析,找出该算法的约简不完全的原因,并讨论了启发信息的构造,进而在此基础上提出了以粗糙集的代数理论为基础,以条件信息熵为属性约简的启发式信息的改进算法。

关 键 词:信息熵  约简  粗糙集
文章编号:1001-9081(2006)04-0864-03
收稿时间:2005-10-24
修稿时间:2005-10-24

Improved CEBARKNC on decision table reduction
LI Ming,HUANG Wen-tao,LIU Zhi-yun.Improved CEBARKNC on decision table reduction[J].journal of Computer Applications,2006,26(4):864-866.
Authors:LI Ming  HUANG Wen-tao  LIU Zhi-yun
Affiliation:School of Computer and Communication, Lanzhou University of Technology, Lanzhou Gansu 730050, China
Abstract:CEBARKNC(Conditional Entropy-Based Algorithm for Reduction of Knowledge without Computing Core) algorithm is based on conditional information entropy for reduction of decision table, but the algorithm is incomplete for some decision table.After analyzing the CEBARKNC algorithm,the reason for incomplete reduction was found,the construction of the heuristic information was discussed,and an improved algorithm which combined the algebra of the rough set theory and the conditional information entropy was put forward. The conditional information entropy was the heuristic information of the attribute reduction.
Keywords:information entropy  reduction  rough set
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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