| 基于浓缩布尔矩阵的属性约简算法 |
| |
| 引用本文： | 殷志伟,张健沛.基于浓缩布尔矩阵的属性约简算法[J].哈尔滨工程大学学报,2009,30(3). |
| |
| 作者姓名： | 殷志伟 张健沛 |
| |
| 作者单位： | 哈尔滨工程大学,计算机科学与技术学院,黑龙江,哈尔滨,150001 |
| |
| 摘 要： | 属性约简是粗糙集理论研究的核心内容之一,最常用的计算属性约简的方法是基于Skowron可辨识矩阵的方法.为解决该类方法中存在的如应用范围受限、时间及存储空间浪费和效率瓶颈等问题,提出了一种基于浓缩布尔矩阵的属性约简算法:通过提出浓缩布尔矩阵的概念,以布尔代数的形式有效解决了现有可辨识矩阵存储空间大、生成效率低等缺点;利用一种新的用于直接生成分辨函数最小析取范式的算法,有效改善了算法的时间和空间复杂度,从而提高了属性约简算法的效率.
|
| 关 键 词： | 粗糙集 属性约简 差别矩阵 析取范式 |
An attribute reduction algorithm Based on a concentration Boolean matrix |
| |
| YIN Zhi-wei,ZHANG Jian-pei.An attribute reduction algorithm Based on a concentration Boolean matrix[J].Journal of Harbin Engineering University,2009,30(3). |
| |
| Authors: | YIN Zhi-wei ZHANG Jian-pei |
| |
| Affiliation: | College of Computer Science and Technology;Harbin Engineering University;Harbin 150001;China |
| |
| Abstract: | The attribute reduction is one of the core contents in the theoretical research of rough sets.The most popular algorithm for attribute reduction is Skowron's discernibility matrix.In order to overcome limits to the algorithm's range of application,its waste of time and space,and its performance bottlenecks,an attribute reduction algorithm based on a concentration Boolean matrix was proposed.By applying the concepts of a concentration Boolean matrix,high storage space requirements and execution inefficiencie... |
| |
| Keywords: | rough set attribute reduction differential matrix disjunctive normal form |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
