A Quick Algorithmfor Reduction of Attribute in Information Systems

Reduction of attribute is one of the key problems in rough set theory. In this paper, Using recursive idea, we design a new approach to calculate partition U/C, whose time complexity is O(\C \\U\). Then two new and relatively reasonable formulas measuring attribute significance are designed for reducing searching space, which are used as heuristic information to develop a quick attribute reduction algorithm; the theoretical analysis shows that this algorithm is much less time complexity than those existed algorithms. Finally, experimental results demonstrate its feasibility and effectiveness, respectively.