| 关于二进制可辩矩阵的化简算法注记 |
| |
| 引用本文： | 周海岩,兀丽娟. 关于二进制可辩矩阵的化简算法注记[J]. 太原师范学院学报(自然科学版), 2003, 2(2): 1-4 |
| |
| 作者姓名： | 周海岩 兀丽娟 |
| |
| 作者单位： | 1. 太原师范学院,计算机系,山西,太原,030012
2. 太原理工大学阳泉学院,信息系,山西,阳泉,045000 |
| |
| 摘 要： | 指出支天云、苗夺谦提出的二进制可辩短阵的化简算法所存在的问题，并给出了一个改正／改进而更加高效的二进制可辩矩阵的化简算法．
|
| 关 键 词： | 二进制可辩矩阵 化简算法 粗糙集 属性约减算法 |
| 文章编号： | 1672-2027(2003)02-0001-04 |
| 修稿时间： | 2002-11-18 |
A Note Binary Discernibility Matrix''s Reduction Algorithm |
| |
| Zhou Haiyan Wu Lijuan. A Note Binary Discernibility Matrix''s Reduction Algorithm[J]. Journal of Taiyuan Normal University:Natural Science Edition, 2003, 2(2): 1-4 |
| |
| Authors: | Zhou Haiyan Wu Lijuan |
| |
| Abstract: | A problem existed in a paper about binary discernible matrix reduction algorithm by Zhi Tianyun and Miao Duoqian is pointed out.And the original algorithm is moditied and improved,therefore a more efficient binary discernible matrix's reduction algorithm is presented. |
| |
| Keywords: | rough sets binary discernible matrix reduction algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
