Rough Set Approach for Processing Information Table

To deal with the problem of completing the information table, a new method was studied and proposed. First, define discernible vector and its addition rule by the indiscernible relation in rough set. Second, scan discernible vectors just only one time by the discernible vector addition rule in order to obtain the core attribute set and the important attributes. Then obtain a reduced attribute set by deleting redundant attributes. Finally, according to the dependence relation of condition and decision attributes, select the important breaking points,and complete the information table with the constraints of classification quality. The illustration and experiment results indicate that the method is effective and efficient.