Efficient Attribute Reduction Algorithm.

Efficiency of algorithms is always an important issue concerned by so many researchers. Rough set theory is a valid tool to deal with imprecise problems. However, some of its algorithms’ consuming time limits the applications of rough set. According to this, our paper analyzes the reasons of rough set algorithms’ inefficiency by focusing on two important factors: indiscernible relation and positive region, and analyzes an equivalent and efficient method for computing positive region. And according to our research on the efficiency of some basic issues of rough set, a complete algorithm for the reduction of attributes is designed and its completeness is proved. Theoretical analysis and experimental results illustrate that our reduction algorithm is more efficient than some other algorithms.