A Quick Attribution Reduction Algorithm Based on Incomplete Decision Table

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 171-172)

Pages:

154-158

Citation:

Online since:

December 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Pawlak Z, Skowron A. Rudiments of rough sets[J]. Information Sciences. 2007, 117(1): 3-37.

Google Scholar

[2] Kryszkiewicz M. Rules in incomplete information systems[J]. Information Sciences, 1999, 113(2): 271-292.

DOI: 10.1016/s0020-0255(98)10065-8

Google Scholar

[3] Liang J Y, Xu Z B. The algorithm on knowledge reduction in incomplete information systems [J]. Uncertainty Fuzziness and Knowledge-Based Systems, 2002, 10(1) : 95-103.

DOI: 10.1142/s021848850200134x

Google Scholar

[4] Qian Y. H, Liang J.Y. Positive approximation and rule extracting in incomplete information systems[J]. Computer Science and Knowledge Engineering. 2008, 12(1) : 67-80.

Google Scholar

[5] Yuhua Qian, Jiye Liang, Deyu Li et al. Approximation reduction in inconsistent incomplete decision tables[J]. Knowledge-Based Systems, 2010, 23: 427: 433.

DOI: 10.1016/j.knosys.2010.02.004

Google Scholar

[6] HUANG Bing, ZHOU Xian-zhong, ZHANG Rong-rong. Attribute Reduction Based on Information Quantity under Incomplete Information Systems[J]. Systems Engineering-Theory &Practice, 2005, 25(4): 55-60.

Google Scholar

[7] HUANG Hai, WANG Guo-yin, Wu Yu. Direct Reduction Method for Incomplete Information System[J]. MINI- MICRO SYSTEMS, 2005, 26(10): 1761-1765.

Google Scholar

[8] XU Zhang-yan, LIU Zuo-Peng, etc. A quick attribute reduction algorithm with complexity of [J]. Chinese Journal of computers. 2006, 29(3) : 391-399.

Google Scholar