一种新的不完备信息系统中极大相容块的构造算法

A New Algorithm of Constructing Maximal Consistent Block in Incomplete Information System

在不完备信息系统中以分层递阶的方式求取极大相容块的构造算法,简化了不完备信息系统中极大相容块的求取过程.然而,该算法有一定不足之处,在求取极大相容块的中间过程中,没有进行非极大相容块的去除,从而增加了算法的空间复杂度,所以该算法仅适用于小规模不完备信息系统.基于这个缺点,提出了改进的极大相容块求取算法,从而可以在较大规模的不完备信息系统中进行极大相容块的求取.

A hierarchical algorithm for constructing Maximal Consistent Block in Incomplete Information System is proposed in [2].As a result,the process for constructing Maximal Consistent Block is greatly simplified.However,There is a weak point in the algorithm,while computing the maximal consistent block,without dislodging the Non-Maximal Consistent Block.As a result ,The Space-complexity of program is proved greatly,so the algorithm used only to a small Incomplete Information System.Based the fatal shortcoming,In the present paper,A better algorithm is provided,which would be used to the major Incomplete Information System.