Study on reduct and core computation in incompatible information systems

Abstract

Reduct and core computation is one of the key problems in rough set theory due to its applications in data mining extensively. Much attention presently has paid to it in compatible information system. However, in practice, many information systems are incompatible because of noise or incomplete data. In this paper, reduct and core computation for incompatible information systems is studied based on the algebraic view. A new method to construct discernibility matrix is proposed, which is a generalization of the methods presented by Hu(1995), Ye(2002) and Qing(2003). Moreover, the results are suitable for compatible information systems.