loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 IEEE International Conference on Granular Computing (GRC 2007)
Algorithms for Different Approximations in Incomplete Information Systems with Maximal Compatible Classes as Primitive Granules
San Jose, California
November 02-November 04
ISBN: 0-7695-3032-X
This paper proposes some expanded rough set models with maximal compatible classes as primitive granules, introduces two new granules for extending rough set model, and designs algorithms to solve maximal compatible classes, to find the lower and upper approximations according to the newly granules, to compute reducts and minimal reducts with attribute significance. It also verifies the validity of algorithms by examples. These provide an important and implemental theoretical base for rough set theory to deal with problems in incomplete information systems . Key words: incomplete information system; rough set model; maximal compatible class; algorithm
Citation:
Chen Wu, Xiaohua Hu, Zhoujun Li, Xiaohua Zhou, Palakorn Achananuparp, "Algorithms for Different Approximations in Incomplete Information Systems with Maximal Compatible Classes as Primitive Granules," grc, pp.169, 2007 IEEE International Conference on Granular Computing (GRC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.