There are already some extensions of rough set theory for incomplete information systems, such as tolerance relation, limited tolerance relation, similarity relation, and etc. But there are no approaches and algorithms for these extensions. A direct approach for processing incomplete information systems is developed in this paper, including discretization, attribute reduction, value reduction, and rule matching. This approach can be used in all kinds of extensions of rough set theory for incomplete information systems. It is both effective in complete and incomplete information systems.
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.