By Topic

Improvement of decision table attribute reduction algorithm based on Discernibility Matrix

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

3 Author(s)
Daoguo Li ; Sch. of Manage., Hangzhou Dianzi Univ., Hangzhou ; Hualong Ma ; Yiqi Yin

The discernibility matrix, be put forward by Skowron in 1992, is one of effective knowledge acquisition approaches for knowledge representation system. This method is easy to understand and manipulate , but it may cause some error when we use it to calculate the relative core and reductions of inconsistent decisions, while redundant informations are also involved. To amend the limitation of the discernibility matrix way and to decrease computation complexity of its algorithm, the new inconsistent decision table attributes reduction algorithm based on discernibility matrix and fission tactic is proposed in this paper, which is suitable for whichever a KRS, and reducing algorithm computation complexity effectively. By comparing with the origin and other existing improving algorithm, the new attributes reduction algorithm based on discernibility matrix is showed more concision and more efficiency.

Published in:

Automation and Logistics, 2008. ICAL 2008. IEEE International Conference on

Date of Conference:

1-3 Sept. 2008