TY - GEN
T1 - Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules
AU - Wu, Chen
AU - Hu, Xiaohua
AU - Li, Zhoujun
AU - Zhou, Xiaohua
AU - Achananuparp, Palakorn
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
KW - Algorithm
KW - Incomplete information system
KW - Maximal compatible class
KW - Rough set model
UR - https://www.scopus.com/pages/publications/46749115192
U2 - 10.1109/GRC.2007.4403088
DO - 10.1109/GRC.2007.4403088
M3 - 会议稿件
AN - SCOPUS:46749115192
SN - 076953032X
SN - 9780769530321
T3 - Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007
SP - 169
EP - 174
BT - Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007
T2 - 2007 IEEE International Conference on Granular Computing, GrC 2007
Y2 - 2 November 2007 through 4 November 2007
ER -