Discernibility Matrix-Based Attribute Reduction Algorithm of Decision Table

Article Preview

Abstract:

A discernibility matrix-based attribute reduction algorithm of decision table is introduced in this paper, which takes the importance of attributes as the heuristic message. This method solves the problem of the attribute selection when the frequencies of decision table attributes are equal. The result shows that this method can give out simple but effective method of attribute reduction.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 457-458)

Pages:

1230-1234

Citation:

Online since:

January 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Pawlak Z: Rough sets and intelligent data analysis, Information Sciences (2002), p.147: 1-12.

Google Scholar

[2] Pawlak Z and Skowron A: Rough sets: Some extensions, Information Sciences (2007), p.177: 41-73.

DOI: 10.1016/j.ins.2006.06.006

Google Scholar

[3] Pawlak Z: Rough sets: Theoretical Aspects of Reasoning about Data, Warsaw (1991), p. x.

Google Scholar

[4] Yuqing Peng, GuoXi Xiao, and Xin Yang: Data Structure Algorithm Animation Demo implementation of CAI software, Journal of Continue Education of Hebei University of Technology, vol. 15(Mar. 2000), pp.1-4.

Google Scholar

[5] Q. Liu: Rough Set and Rough Reasoning, 1st ed., Beijing: Science Press, (2001), pp.48-53.

Google Scholar

[6] Tianyun Zhi and Qianduo Miao: The Binary Discernibility Matrix s Transformation and High Efficiency Attributes Reduction Algorithm s Conformation, Computer Science, vol. 29(2002), pp.140-142.

Google Scholar

[7] Wenbing Qian, Zhangyan Xu, Liyu Hang, and Bingru Yang: Attribution reduction algorithm based on binary discernibility matrix of information entropy, Computer Engineering and Applications, vol. 46(2010), pp.120-123.

Google Scholar

[8] Xiaokang Ren, Shangzhi Wu, and Ruyun Ma: An algorithm of attribute frequency reduction based on discernibility matrix, Journal of Lanzhou University (Natural Sciences), vol. 43(2003), pp.138-140.

Google Scholar

[9] Pawlak Z: Rough sets: Theoretical Aspects of Reasoning about Data, Warsaw (1991), p.60.

Google Scholar

[10] Shaohui Liu, Qiujian Sheng, Bing Wu, Zhongzhi Shi, and Fei Hu: Research on Efficient Algorithms for Rough Set Methods, Chinese Journal of Computers, vol. 26(2003), pp.524-529.

Google Scholar