Abstract: This paper puts forward the definition of the basic binary discernibility matrix and it’s simplify method in discretization. Discretization algorithm based on simplify binary discernibility matrix is proposed. It changes symbolic computation into binary operation, can save the storage space and computing time efficiently. Cut significance is investigated at two different levels, which can lead the solution to optimization. Only using the new adding cut’s corresponding bit operate with the rows of the matrix corresponding bit, can reduce computing time further. Analysis of the example shows that the algorithm is correct and efficient.

Key words: rough set theory, discretization, binary discernibility matrix, simplify binary discernibility matrix

摘要： 提出离散化中基本二进制区分矩阵的定义及其简化方法和基于简化二进制区分矩阵的离散化算法，把符号运算转变成二进制运算，有效地节约了存储空间和运算时间。从区分度和区分率两个不同层次考察断点的重要性，引导求解过程趋于最优化，只采用新增加的断点对应位与矩阵的行相应位进行运算，进一步提高计算效率。实例分析表明算法是正确有效的。

关键词: 粗糙集理论, 离散化, 二进制区分矩阵, 简化二进制区分矩阵