A Quick Attribution Reduction Algorithm based on Incomplete Decision Table

At present, some scholars have provided the attribution reduction algorithms of incomplete decision table. The time complexity of many algorithms are O(|C|(3)|U|(2)).To cut down the time complexity of the algorithms for computing attribution reduction, the definition of discemibility matrix based on positive region and the corresponding definition of the attribution reduction are provided. At the same time, it is proved that the attribution reduction is equivalent to the attribution reduction based on the positive region. The discemibility matrix is simplified for not comparing the objects between U-neg. On this condition, a efficient algorithm for computing attribution reduction is designed with the simplified discemibility matrix, whose time complexity is max{O(|C|(2)|U-px||U|, O(K|C||U|)} (K=max{|T-c(x(i))|,x(i)is an element of U}). At last, an emulate example is used to illustrate the efficiency of the new algorithm.