期刊
INFORMATION SCIENCES
卷 181, 期 6, 页码 1125-1137出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2010.11.004
关键词
Soft sets; Rough sets; Soft rough sets; Soft approximation spaces; Soft rough approximations; Granular computing
资金
- National Natural Science Foundation of China [10926031, 10571112]
- Natural Science Foundation of Education Department of Shaanxi Province of China [2010JK831]
- Shaanxi Provincial Research and Development Plan of Science and Technology [2008K01-33]
In this study, we establish an interesting connection between two mathematical approaches to vagueness: rough sets and soft sets. Soft set theory is utilized, for the first time, to generalize Pawlak's rough set model. Based on the novel granulation structures called soft approximation spaces, soft rough approximations and soft rough sets are introduced. Basic properties of soft rough approximations are presented and supported by some illustrative examples. We also define new types of soft sets such as full soft sets, intersection complete soft sets and partition soft sets. The notion of soft rough equal relations is proposed and related properties are examined. We also show that Pawlak's rough set model can be viewed as a special case of the soft rough sets, and these two notions will coincide provided that the underlying soft set in the soft approximation space is a partition soft set. Moreover, an example containing a comparative analysis between rough sets and soft rough sets is given. (C) 2010 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据