Search

Knowledge reduction is one of the key problems of rough set theory. In this paper, we investigate some theoretical issues of the reduction of information systems and present a new reduction approach. A closure operator on the power set of attributes is defined. The relations between the closed sets determined by the closure operator and the indiscernibility attribute sets are then investigated. Based on the relations, we can determine a partition on the power of attributes by using the indiscernibility attribute sets. Consequently, the reducts of any subset of attributes in information systems can be derived. [ABSTRACT FROM AUTHOR]