Application of a matrix-based binary granular computing algorithm in RST

Upper approximation and lower approximation are the basic definitions in rough set theory (RST). Equivalent partition generates classification and brings granulation structures of a universe. As the extension of RST, in this paper, a matrix-based binary granular computing algorithm is proposed. Furthermore, a standardized algorithm is designed to compute the positive region, negative region, the accuracy and the quality of approximation, which are the most essential concepts in RST and the foundations for further research. The proposed algorithm is a kind of logical approach which is easier to implement and faster than the traditional algebraic one. It is a successful application of binary granular computing in RST.