Entropy Based Attribute Reduction Algorithms for Rough Sets

Article Preview

Abstract:

This paper presented a concept of knowledge entropy, and according to this concept the importance of attribute was defined. Algorithms for attribute reduction in rough sets based on concept of knowledge entropy was given, and an example analysis was done in this paper. For the example, the calculation result is coincident with the result calculated by using the traditional method of attribute reduction in rough set theory.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1859-1862

Citation:

Online since:

December 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Jiye Liang, Deyu Li. Uncertainty and Knowledge Acquisition in Information System(In Chinese). Beijing: Science Press, (2005)

Google Scholar

[2] Duoqian Miao, Daoguo Li. Theory, Algorithm, and Application of Rough Set(In Chinese). Beijing: Tsinghua University Press,(2008)

Google Scholar

[3] Hong Li. Journal of Computer Engineering and Applications, (2005)

Google Scholar

[4] Yurong Li, Bin Qiao and Jingping Jiang. Journal of Circuits and Systems,(2002)

Google Scholar

[5] Ling Zhou, Kexue Li. Journal of Zhengzhou University of Light Industry(Natural Science Edition), (2007)

Google Scholar

[6] Jingmei Zhai. Research on Methods of Quality Diagnosis & Control and Decision Support System for Manufacturing Processes(In Chinese). A Doctoral Dissertation, submitted to: South China University of Technology, (2003)

Google Scholar

[7] Duoqian Miao, Jue Wang. An information-based algorithm for reduction of knowledge. In: IEEEIC IPS'97,1997:1155-1158

Google Scholar