Rough Computational Approach to UAR based on Dominance Matrix in IOIS

HTML  Download Download as PDF (Size: 83KB)  PP. 131-136  
DOI: 10.4236/iim.2011.34016    4,845 Downloads   7,880 Views  Citations

Affiliation(s)

.

ABSTRACT

Rough set theory is a new mathematical tool to deal with vagueness and uncertainty. The classical rough set theory based on equivalence relation has made a great progress, while the equivalence relation is too harsh to meet and is extended to dominance relation in real world. It is important to investigate rough computational methods for rough set theory, which is one of the bottleneck problems in the development of rough set theory. In this article, rough computational approach to upper ap-proximation reduction (UAR) is discussed based on dominance matrix in inconsistent ordered information systems (IOIS). The algorithm of upper approximation reduction is obtained, from which we can provide approach to upper approximation reduction operated simply in inconsistent systems based on dominance relations. Finally, an example illustrates the validity of this method, and shows the method is excellent to a complicated information system.

Share and Cite:

X. Zhang and W. Xu, "Rough Computational Approach to UAR based on Dominance Matrix in IOIS," Intelligent Information Management, Vol. 3 No. 4, 2011, pp. 131-136. doi: 10.4236/iim.2011.34016.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.