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 .To cut down the time complexity of the algorithms for computing attribution reduction , the definition of discernibility 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 discernibility matrix is simplified for not comparing the objects between .On this condition, a efficient algorithm for computing attribution reduction is designed with the simplified discernibility matrix, whose time complexity is .At last, an emulate example is used to illustrate the efficiency of the new algorithm.
Zhihua Xu, Gang Shen and Sally Lin
W. H. Shu et al., "A Quick Attribution Reduction Algorithm Based on Incomplete Decision Table", Advanced Materials Research, Vols. 171-172, pp. 154-158, 2011