A Different Quantity of Partition-Based Efficient Algorithm for Reduction of Attribute in Information Systems

Reduction of attribute is one of the key problems in rough set theory. In this paper, first, the notion of different quantity of partition is defined in information systems; from the viewpoint of which two new and relatively reasonable formulas measuring attribute significance are designed for reducing searching space. Then the two formulas are used as heuristic information to develop an efficient attribute reduction algorithm, which can avoid repeatedly calculating important value of unimportant attributes; the theoretical analysis shows that this algorithm is much less time complexity than those existed algorithms. Finally, an example and experimental results demonstrate its feasibility and effectiveness, respectively.