A New Reduction Algorithm Based on 0-1 Distinguish Matrix

Reduct is an important concept introduced by rough sets theory, and seeking the minimum reduction (MR) is a NP-hard problem. This paper is to present a novel reduction algorithm to search the optimal solution for MR. Firstly, a new 0-1 distinguish matrix was presented to describe the differences among the attributes. And an integer optimization model was built for the MR problem based on the matrix. Then by designing search operators and parameters suitably, we proposed a homogeneous simulated annealing reduction algorithm to solve the MR problem. Finally, the empirical analysis result on the micro-electromechanical systems (MEMS) field show that the SA algorithm is feasible and efficient