基于二进制可辨矩阵的知识约简(待续)

Knowledge Reduction Algorithm Based Binary Discernibility Matrix(to be Continued)

对决策表的二进制可辨矩阵[11] 进行先期化简的算法[10 ] 可大大减少知识约简的操作对象 ,大大加快知识约简的速度 ,是一种很有前途的知识约简的新方法 .但目前的二进制矩阵的化简规则不是有效完备的 ,在有些情况下求出的不是约简 (不有效 ) ,在有些情况下有的约简不能由化简后的矩阵求出 (不完备 ) .本文将严格地研究二进制矩阵化简的有效完备性 ,并给出求最简有效完备矩阵的算法 。

The algorithm simplifying Binary Discernibility Matrix in advance is a new promising method.It can decrease the operating objects of knowledge reduction and speed up knowledge reduction greatly.But the present reduction rules of Binary Discernibility Matrix aren't sound and complete.Under certain circumstances,some result is not reduction (not sound).However,under other circumstances,some reduction can not be obtained from matrix simplified (not complete).This paper discusses soundness and completeness of simplifying Binary Discernibility Matrix strictly and gives an algorithm getting the simplest Binary Discernibility Matrix,so the promising algorithm has a solid theoretic foundation.