By Topic

A Heuristic Algorithm for Attribute Reduction of Decision-making Problem Based on 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
$33 $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

3 Author(s)
Chang-rui Yu ; Shanghai Jiao Tong University, China ; Hong-wei Wang ; Yan Luo

As a basic problem in rough set (RS) theory, the attribute reduction of decision-making problem is to remove superfluous attributes from problem representation (i.e. decision tables) while preserving the consistency of classifications the original decision system provides. Identifying all reductions or the minimal reductions of a decision-making problem is already proved to be NP-hard. Therefore, heuristic rules are needed to solve this kind of NP-hard problem with higher efficiency during the reduction finding process. In this paper, we introduce some concepts of rough set relevant to reduction and present an algorithm combining discernibility matrix (DM) and principal component analysis (PCA) as heuristic knowledge to find the reduction

Published in:

Sixth International Conference on Intelligent Systems Design and Applications  (Volume:1 )

Date of Conference:

16-18 Oct. 2006