A Simple Reduction Analysis and Algorithm Using Rough Sets

Abstract

Indiscernibility relation and attribute reduction criteria are the important concepts in rough sets, also are the important base for further researching on attribute reduction. By analyzing the set theory background of indiscernibility and the reduction theory, it can be seen that an information system has the similar characteristics relative to a relation database table and can be analyzed using its data table structure. Combining the structure information of the system with the rough sets reduction theory, a simple reduction analysis can be completed and get useful reduction information. Such as whether a system has redundant attributes or not and how many attributes are need by the system to maintaining its classes, etc. The analysis is realized by a simple algorithm: PARA, the algorithm together with an effective heuristics algorithm can decide an area of the minimum reduct. It greatly reduces the searching area of finding minimum reduct and can play some role in high-dimensionality reduction. A given example shows the algorithm.Keywordsrough setsattribute reductionset theorydata table structurealgorithm