An Algorithm of Attribute Reduct Based on Rough Set

Article Preview

Abstract:

Attribute reduction is a key problem for rough set theory. While computing reduction according to the definitions is a typical NP problem. In this paper, basic concept of rough set theory is presented, one heuristic algorithm for attribution reduction based on conditional entropy is proposed. The actual application shows that the method is feasible and effective

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3177-3181

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Z. Pawlak, Rough sets, International Journal of Computer and Information Sciences 11 (1982) 341-356.

Google Scholar

[2] PawlakZ. Rough set approach to multi-attribute decision analysis [J]. European Journal of Operational Research, 1994, 72: 443-459.

DOI: 10.1016/0377-2217(94)90415-4

Google Scholar

[3] Wenxiu Zhang, Weizhi Wu, Jiye Liang. Theory and Approach in Rough Set[M]. Beijing: Science Press, 2001(in Chinese).

Google Scholar

[4] D.Q. Miao, J. Wang, An information representation of the concepts and operations in rough set theory, Journal of Software 10 (1999) 113-116 (in Chinese).

Google Scholar

[5] D.Q. Miao, Daoguo Li. Theory, algorithm and application in rough set[M]. beijing: tsinghua university press. 2008, 4(in Chinese).

Google Scholar

[6] Skowron, A, Rauszer, C., The discernibility matrices and functions in information systems, Slowifiski(Ed. ), Intelligent decision support: Handbook of applications and advances of rough set theory, Kluwer Academic Publishers, Dordrecht, volume 11, 1992, pp.331-362.

DOI: 10.1007/978-94-015-7975-9_21

Google Scholar