By Topic

Rough Set Theory-based Multi-class Decision Attribute Reduction Algorithm and Its Application

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)
Yitian Xu ; College of science, China Agricultural University, Beijing, 100083, China, ; Laisheng Wang ; Yanping Sheng

Rough set theory is an effective tool in dealing with vague and uncertainty information, attribute reduction is one of its important concept. Many attribute reduction algorithms have been proposed, but they are more suitable for two classes problem. For multi-class decision attributes problem, a new attribute reduction algorithm based on discernibility matrix is proposed in the paper, it makes great use of the advantage of decision attribute's class information. In addition, we may draw an important conclusion that attribute reduction connects with class information in multi-class decision system, that is to say there will be deferent reduction results between deferent classes. The proposed algorithm can effectively reduce the computational complexity and increase reduction efficiency. Finally it is applied to diesel engine fault diagnosis, diagnosis result shows its feasibility and validity

Published in:

2006 5th IEEE International Conference on Cognitive Informatics  (Volume:2 )

Date of Conference:

17-19 July 2006