By Topic

Algorithm with database technology for computing the core based on Skowron's 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
$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

1 Author(s)
Guiying Wei ; School of Economics and Management, University of Science and Technology Beijing, China

Designing efficient algorithm for computing the core of decision table is a very meaningful work because the core is the foundation of constructing attribute reduction of the decision table and multi-variable decision tree. To improve the efficiency of the algorithm for computing the core based on Skowron's discernibility matrix with database technology, the new simplified decision table of the old decision table is defined. And it is proved that the core of the new simplified decision table based on positive region is the same as the core of the old one based on Skowron's discernibility matrix. Then an efficient algorithm is proposed for computing the new simplicity decision table. On this condition, an efficient algorithm for computing the core based on Skowron's disceribility matrix by using database technology is designed. At the end, an example is used to illustrate the efficiency of the new algorithm.

Published in:

Advanced Computer Control (ICACC), 2010 2nd International Conference on  (Volume:2 )

Date of Conference:

27-29 March 2010