Attribute reduction is an important issue in rough set theory. Many efficient algorithms have been proposed, however,
few of them can process huge data sets quickly. In this paper, combining the Trie tree, the algorithms for computing
positive region of decision table are proposed. After that, a new algorithm for attribute reduction based on Trie tree is
developed, which can be used to process the attribute reduction of large data sets quickly. Experiment results show its
high efficiency.
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.