期刊
INFORMATION SCIENCES
卷 179, 期 3, 页码 210-225出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2008.09.015
关键词
Rough set; Fuzzy set; Granular computing; Data mining; Reduction; Covering; Approximation
资金
- National Science Foundation of China [60873077/17020107]
- Key Laboratory of Complex Systems and Intelligence Science
- Institute of Automation, Chinese Academy of Sciences [20070105]
Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. This paper systematically studies a type of generalized rough sets based on covering and the relationship between this type of covering-based rough sets and the generalized rough sets based on binary relation. Firstly, we present basic concepts and properties of this kind of rough sets. Then we investigate the relationships between this type of generalized rough sets and other five types of covering-based rough sets. The major contribution in this paper is that we establish the equivalency between this type of covering-based rough sets and a type of binary relation based rough sets. Through existing results in binary relation based rough sets, we present axiomatic systems for this type of covering-based lower and upper approximation operations. In addition, we explore the relationships among several important concepts such as minimal description, reduction, representative covering, exact covering, and unary covering in covering-based rough sets. Investigation of this type of covering-based will benefit to our understanding of other types of rough sets based on covering and binary relation. (c) 2008 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据