The algebraic structures of generalized rough set theory

被引：284

作者：

Liu, Guilong ^{[1
]}

Zhu, William ^{[2
]}

机构：

[1] Beijing Language & Culture Univ, Sch Informat Sci, Beijing 100083, Peoples R China

[2] Univ Elect Sci & Technol China, Coll Comp Sci & Engn, Chengdu 610054, Peoples R China

来源：

INFORMATION SCIENCES | 2008年 / 178卷 / 21期

关键词：

rough sets; generalized rough sets; granular computing; approximation operators; solitary sets;

D O I：

10.1016/j.ins.2008.06.021

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 [计算机科学与技术];

摘要：

Rough set theory is an important technique for knowledge discovery in databases, and its algebraic structure is part of the foundation of rough set theory. In this paper, we present the structures of the lower and upper approximations based on arbitrary binary relations. Some existing results concerning the interpretation of belief functions in rough set backgrounds are also extended. Based on the concepts of definable sets in rough set theory, two important Boolean subalgebras in the generalized rough sets are investigated. An algorithm to compute atoms for these two Boolean algebras is presented. (C) 2008 Elsevier Inc. All rights reserved.

引用

页码：4105 / 4113

页数：9

共 35 条

[1]

[Anonymous], 1998, ROUGH SETS KNOWLEDGE

[2]

[Anonymous], 1994, Advances in the Dempster-Shafer Theory of Evidence

[3]

[Anonymous], 1998, ROUGH SETS KNOWLEDGE

[4]

Roughness of a fuzzy set [J].