计算机工程与应用Issue(21)：214-217,4.DOI:10.3778/j.issn.1002-8331.1212-0373
基于二进制区分矩阵的离散化算法
Discretization algorithm based on binary discernibility matrix
摘要
Abstract
This paper puts forward the definition of the basic binary discernibility matrix and it’s simplify method in discreti-zation. Discretization algorithm based on simplify binary discernibility matrix is proposed. It changes symbolic computa-tion 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分类
信息技术与安全科学引用本文复制引用
侯利娟,史长琼..基于二进制区分矩阵的离散化算法[J].计算机工程与应用,2014,(21):214-217,4.基金项目
湖南省教育厅资助科研项目（No.09C083）。 （）
