Memory Efficient Reduct Algorithm of Tolerance Information Systems Using Sparse Matrix

摘要

In this paper, on the basis of studying the limitations of the basic rough set model, we present Tolerance Information Systems, which is based on a family set of tolerance relations between objects when given a set of tolerance relations. The model inherits most of the characteristics of the basic model of rough set; and they also have a better effect of approximation classification. Based on this model, we propose a memory efficient algorithm that will give us a near-optimal attributes reduct using sparse matrix.