Cart (Loading....) | Create Account
Close category search window
 

An Improved Heuristic Algorithm Used in Attribute Reduction of Rough Set

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Li Zhang ; Dalian Univ. ofTechnol., Dalian ; Xiuying Lu ; Huayu Wu ; Song Liu
more authors

The paper discusses the problem for attribute reduction based on rough set theory, and an improved heuristic algorithm for attribute reduction is presented based on generalized characteristic table. In the algorithm, generalized characteristic table is first simplified and the attribute core is obtained; the heuristic information is constructed subsequently according to the significance of condition attributes to make recursive calculation; the reduction results are obtained at last. The algorithm can be used in consistent and inconsistent decision table. The improved algorithm is proved to be more effective by analyzing the experimental results.

Published in:

Data, Privacy, and E-Commerce, 2007. ISDPE 2007. The First International Symposium on

Date of Conference:

1-3 Nov. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.