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

基于条件信息量的快速粗集约简算法
引用本文:祁立,刘玉树.基于条件信息量的快速粗集约简算法[J].北京理工大学学报,2007,27(7):604-608.
作者姓名:祁立  刘玉树
作者单位:北京理工大学,计算机科学技术学院,北京,100081;北京理工大学,计算机科学技术学院,北京,100081
摘    要:为提高粗集约简的效率,提出了一种基于条件信息量的快速粗集约简算法.该算法定义了基于等价块的信息量与条件信息量,并给出了条件信息量的不变性定理与属性重要度的单调性定理.与其他算法相比较,该算法缩小了实例集合的规模,减少了需要计算重要度的属性个数.实验结果表明,保持约简集合不变的前提下,该算法有效提高了粗集约简的效率.

关 键 词:粗糙集  条件信息量  快速约简算法
文章编号:1001-0645(2007)07-0604-05
收稿时间:2006/12/21 0:00:00
修稿时间:2006-12-21

Rapid Reduction Algorithm Based on the Conditional Information Quantity
QI Li and LIU Yu-shu.Rapid Reduction Algorithm Based on the Conditional Information Quantity[J].Journal of Beijing Institute of Technology(Natural Science Edition),2007,27(7):604-608.
Authors:QI Li and LIU Yu-shu
Institution:School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
Abstract:To improve the efficiency of attribute reduction, a rapid reduction algorithm based on conditional information quantity is proposed. The concepts of information quantity based on partition and conditional information quantity based on partition are defined, and the theorems about the monotone of attribute significance~invariance of conditional information quantity based on partition are proven; Compared with other algorithms, this algorithm reduces the searching space of attributes and samples in each step. Experimental results showed that the rapid reduction algorithm is more efficient than the existing algorithms.
Keywords:rough set  conditional information quantity  rapid reduction algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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