A New Reduction Implementation Based on Concept

Rough set is one of the most useful data mining techniques. How to use rough set to extract rule is the basement of rough set's application. This paper discuss an algorithm that be used in attribute reduction. To attribute reduction, generally method is based on discernibility matrix or its improvement. But this series methods usually get one reduction, can't accommodate uncertain information reasoning. We provide a reduction algorithm, which based on reduction pruning. It can calculate all reductions, and suits any uncertain knowledge reasoning. For increase this algorithm's effective, we present two theorems to make algorithm simplified. We calculate reduction through rough reduction (reduction pruning) and backward elimination two steps. The case illustrates we get the reduction effectively through this algorithm.