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

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