By Topic

A Quick Algorithmfor Reduction of Attribute in Information Systems

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

2 Author(s)
Yue-jin Lv ; Guangxi Univ., Nanning ; Jin-hai Li

Reduction of attribute is one of the key problems in rough set theory. In this paper, Using recursive idea, we design a new approach to calculate partition U/C, whose time complexity is O(C \U). Then two new and relatively reasonable formulas measuring attribute significance are designed for reducing searching space, which are used as heuristic information to develop a quick attribute reduction algorithm; the theoretical analysis shows that this algorithm is much less time complexity than those existed algorithms. Finally, experimental results demonstrate its feasibility and effectiveness, respectively.

Published in:

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

Date of Conference:

1-3 Nov. 2007