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

A quick attribute reduction algorithm based on knowledge granularity

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

4 Author(s)
Xu Zhang-yan ; Coll. of Comput. Sci. & Inf. Technol., Guangxi Normal Univ., Guilin, China ; Zhang Wei ; Wang Xiao-yu ; Li Xiao-yu

The research of knowledge granularity has been a hotspot at home and abroad. In incomplete information systems of the rough set, we give a formula, which calculates the attribute frequency directly without acquiring the discernibility matrix. Then applying it to the field of knowledge granularity, we give a quick calculation of the attribute reduction algorithm, which of the time complexity is O(|C|2|U|) in the worst case. The example result shows that the algorithm is correct and efficient.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference:

29-31 May 2012

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.