LBRM Algorithm for Rule Extraction Based on Rough Membership

Article Preview

Abstract:

Rule extraction is a main goal for rough set theory. This paper mainly constructs a new algorithm (LBRM Algorithm) for rule extraction based on rough membership. The confidence principle is established based on rough membership. Thus, LBRM Algorithm is proposed by utilizing discretization and clearness strategies under the fuzzy environment, and is applied to both interval rules and general rules in fuzzy classification. LBRM Algorithm effectiveness is illustrated by a medical example. In particular, LBRM Algorithm integrates the confidence on both previous LBR Algorithm and fundamental rough membership, and has some improvements on rule confidence.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 791-793)

Pages:

1088-1091

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] E. Orlowska: Incomplete information rough set analysis (Physica-Verlag Heideberg, America 1998).

Google Scholar

[2] D. Hu and Z.W. Mo: Pattern Recognition and Artificial Intelligence, Vol. 15 (2002) No. 2, p.129 (in Chinese).

Google Scholar

[3] Z. Pawlak and A. Skowron: Advances in the Dempster-Shafer Theory of Evidenc (Wiley, America 1994) p.251.

Google Scholar

[4] S. Greco, B. Matarazzo and R. Slowinski: International Journal of Approximate Reasoning, Vol. 49 (2008) No. 2, p.285.

Google Scholar

[5] S. Singh and L. Dey: Applied Soft Computing, Vol. 5 (2005) No. 4, p.373.

Google Scholar