We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An approach to knowledge reduction based on relative partition granularity

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)
Qinrong Feng ; Dept. of Comput. Sci.&Technol., Tongji Univ., Shanghai ; Duoqian Miao ; Yi Cheng

Knowledge and classifications are related together by the theory of rough sets which claim is that knowledge is deep-seated in the classification abilities of human beings. In this paper, relative partition granularity, a quantitative representation for the relative classification ability of conditional attributes relative to decision attribute was defined. The equivalence between some basic concepts in rough set theory and relative partition granularity was proved. A heuristic knowledge reduction algorithm was designed based on relative partition granularity. Finally, we show that this algorithm is effective through an example.

Published in:

Granular Computing, 2008. GrC 2008. IEEE International Conference on

Date of Conference:

26-28 Aug. 2008