Cart (Loading....) | Create Account
Close category search window
 

A New Approach to Knowledge Reduction Based on the Set Theory

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

4 Author(s)
Guo-ping Yu ; Inf. Eng. Sch., Nanchang Univ., Nanchang, China ; Li-juan Huang ; Pan Liu ; Yin Liang

As a practical method for knowledge reduction, discernible matrix (DM) has been widely used in practice. However, due to the high cost of constructing and reducing of a matrix, the efficiency of this method falls far short of people's demands. In order to decrease the cost of knowledge reduction based on the ideas of set theory, the paper presents a new approach, which is called the minimum discernible core set (MDCS). Beginning at the selection of an indiscernible attribute, other attributes are added one by one until obtaining a set, which can discern a knowledge system. The paper focuses on the related theories and algorithms of knowledge reduction. Algorithm 1 can get all the MDCS of a knowledge system, while Algorithm 2 that has lower time can get a MDCS of that by using heuristic search rules. Compared with time complexity and space complexity of DM, MDCS has less time and space according to our analysis for the algorithms of DM and MDCS.

Published in:

Management and Service Science, 2009. MASS '09. International Conference on

Date of Conference:

20-22 Sept. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.