Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules

Chen Wu; Xiaohua Hu; Zhoujun Li; Xiaohua Zhou; Palakorn Achananuparp

doi:10.1109/GRC.2007.4403088

Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules

Chen Wu^*
, Xiaohua Hu
, Zhoujun Li
, Xiaohua Zhou
, Palakorn Achananuparp

^*Corresponding author for this work

School of Computer Science and Engineering

Jiangsu University of Science and Technology
Drexel University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007
Pages	169-174
Number of pages	6
DOIs	https://doi.org/10.1109/GRC.2007.4403088
State	Published - 2007
Event	2007 IEEE International Conference on Granular Computing, GrC 2007 - San Jose, CA, United States Duration: 2 Nov 2007 → 4 Nov 2007

Publication series

Name	Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007

Conference

Conference	2007 IEEE International Conference on Granular Computing, GrC 2007
Country/Territory	United States
City	San Jose, CA
Period	2/11/07 → 4/11/07

Keywords

Algorithm
Incomplete information system
Maximal compatible class
Rough set model

Access to Document

10.1109/GRC.2007.4403088

Cite this

Wu, C., Hu, X., Li, Z., Zhou, X., & Achananuparp, P. (2007). Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules. In Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007 (pp. 169-174). Article 4403088 (Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007). https://doi.org/10.1109/GRC.2007.4403088

@inproceedings{a8501b71a86c4268826e7825328cb147,

title = "Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules",

abstract = "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.",

keywords = "Algorithm, Incomplete information system, Maximal compatible class, Rough set model",

author = "Chen Wu and Xiaohua Hu and Zhoujun Li and Xiaohua Zhou and Palakorn Achananuparp",

year = "2007",

doi = "10.1109/GRC.2007.4403088",

language = "英语",

isbn = "076953032X",

series = "Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007",

pages = "169--174",

booktitle = "Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007",

note = "2007 IEEE International Conference on Granular Computing, GrC 2007 ; Conference date: 02-11-2007 Through 04-11-2007",

}

Wu, C, Hu, X, Li, Z, Zhou, X & Achananuparp, P 2007, Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules. in Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007., 4403088, Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007, pp. 169-174, 2007 IEEE International Conference on Granular Computing, GrC 2007, San Jose, CA, United States, 2/11/07. https://doi.org/10.1109/GRC.2007.4403088

Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules. / Wu, Chen; Hu, Xiaohua; Li, Zhoujun et al.
Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007. 2007. p. 169-174 4403088 (Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 -

Wu C, Hu X, Li Z, Zhou X, Achananuparp P. Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules. In Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007. 2007. p. 169-174. 4403088. (Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007). doi: 10.1109/GRC.2007.4403088

Algorithms for different approximations in incomplete information systems with maximal compatible classes as primitive granules

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this