| 一种针对不完备信息系统的粗糙集约简算法 |
| |
| 引用本文： | 邵斌,吴玲丽,蒋云良. 一种针对不完备信息系统的粗糙集约简算法[J]. 微电子学与计算机, 2007, 24(4): 204-207 |
| |
| 作者姓名： | 邵斌 吴玲丽 蒋云良 |
| |
| 作者单位： | 1. 湖州师范学院,信息工程学院,浙江,湖州,313000
2. 湖州师范学院,教育科学与技术学院,浙江,湖州,313000 |
| |
| 基金项目： | 国家自然科学基金;浙江省自然科学基金 |
| |
| 摘 要： | 针对区分矩阵构造庞大,计算工作量大,基于区分矩阵的约简策略效率低的问题,提出一种新型的针对不完备信息系统的属性约简算法NARIIS。提出的约简算法把属性值的个数应用到属性约简上,使该约简算法的时间和空间复杂度都远小于基于区分矩阵的约简策略。
|
| 关 键 词： | 粗糙集 属性约简策略 不完备信息系统 区分矩阵 |
| 文章编号： | 1000-7180（2007）04-0204-04 |
| 修稿时间： | 2006-05-09 |
A Reduction Algorithm of Rough Sets Against Imperfect Information Systems |
| |
| SHAO Bin,WU Ling-li,JIANG Yun-liang. A Reduction Algorithm of Rough Sets Against Imperfect Information Systems[J]. Microelectronics & Computer, 2007, 24(4): 204-207 |
| |
| Authors: | SHAO Bin WU Ling-li JIANG Yun-liang |
| |
| Affiliation: | 1. School of Information Engineering, Huzhou Teachers College, Huzhou 313000, China; 2. School of Education Science and Technology, Huzhou Teachers College, Huzhou 313000, China |
| |
| Abstract: | The paper aims at the matter of the heavy workload of discernibility matrix and the inefficient of the reduction strategy based discernibility matrix,A new attributes reduction arithmetic(NARIIS) aiming at imperfect information systems is proposed. We apply the number of attributes to the attributes reduction so that thet the spatial-temporal complexity of the NARIIS is less than that of the reduction strategy based discernibility matrix. |
| |
| Keywords: | rough sets attributes reduction strategy imperfect information systems discernibility matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
