期刊
INFORMATION SCIENCES
卷 178, 期 21, 页码 4105-4113出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2008.06.021
关键词
rough sets; generalized rough sets; granular computing; approximation operators; solitary sets
资金
- Beijing Language and Culture University
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据