Firstly, the concepts of discernibility degree and relative discernibility degree are presented based on general binary
relations. Then the properties of these concepts are analyzed. Furthermore, an efficient attribute reduction algorithm is
designed based on the relative discernibility degree. Especially, the attribute reduction algorithm is able to deal with
various kinds of extended models of classical rough set theory, such as the tolerance relation-based rough set model,
non-symmetric similarity relation-based rough set model. Finally, the theoretical analysis is backed up with numerical
examples to prove that the proposed reduction method is an effective technique to select useful features and eliminate
redundant and irrelevant information.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.