Research on an efficient rough Set based attribute reduction algorithm

Rough set is a valid mathematical theory developed in recent years, which has the ability to deal with imprecise and uncertain information. It has been proven that computing all the reductions and the minimal reduction of information system is a NP-hard problem. In this paper, a coding and sorting method is proposed to reduce the computational complexity of indiscernibility relation and positive region computation, and so attribute reduction can be obtained efficiently. Experimental results showed that the proposed algorithm computed attribute reduction efficiently.