| 基于二进制可辨矩阵的知识约简(续前) |
| |
| 引用本文： | 马垣.基于二进制可辨矩阵的知识约简(续前)[J].鞍山师范学院学报,2003,5(4):64-67. |
| |
| 作者姓名： | 马垣 |
| |
| 作者单位： | 鞍山科技大学,计算机科学与工程学院,辽宁,鞍山,114002 |
| |
| 摘 要： | 这一部分是在前面严格地研究了二进制可辨矩阵化简有效完备性的基础上，给出二进制探阵化简保持有效完备性的几个具体方法以及求最简有效完备径阵的算法，并给出了这种算法的实例。本解决了10]中没能解决的问题。
|
| 关 键 词： | 二进制可辨矩阵 知识约简 有效性 完备性 算法 计算机 |
| 文章编号： | 1008-2441(2003)04-0064-04 |
| 修稿时间： | 2002年11月6日 |
Knowledge reduction algorithm based binary discernibility matrix |
| |
| MA Yuan.Knowledge reduction algorithm based binary discernibility matrix[J].Journal of Anshan Teachers College,2003,5(4):64-67. |
| |
| Authors: | MA Yuan |
| |
| Abstract: | On the basis of researching soundness and completeness of simplifying Binary Discernibility Matrix strictly in front part of this paper,we give some concrete methods of simplifying Binary Discernibility Matrix keeping soundness and completeness and give an algorithm extracting simplest sound and complete Binary Discernibility Matrix .We also give some examples on the algorithm. This paper solved the problem that can not be solved in \. |
| |
| Keywords: | Knowledge reduction Binary discernibility matrix Soundness Completeness |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
