Multigranulation rough sets: From partition to covering

详细信息    查看全文

• 作者：Guoping Lin^a ; ^b ; ^{guoplin@163.com} ; Jiye Liang^a ; ^{ljy@sxu.edu.cn} ; Yuhua Qian^a ; ^{jinchengqyh@126.com}
• 关键词：Covering ; Multigranulation ; Granular computing ; Rough set
• 刊名：Information Sciences
• 出版年：2013
• 出版时间：20 August, 2013
• 年：2013
• 卷：241
• 期：Complete
• 页码：101-118
• 全文大小：660 K

文摘

The classical multigranulation rough set (MGRS) theory offers a formal theoretical framework for solving the complex problem under multigranulation environment. However, it is noticeable that MGRS theory cannot be applied in multi-source information systems with a covering environment in the real world. To address this issue, we firstly present in this paper three types of covering based multigranulation rough sets, in which set approximations are defined by different covering approximation operators. Then, by using two different approximation strategies, i.e., seeking common reserving difference and seeking common rejecting difference, two kinds of covering based multigranulation rough set are presented, namely, a covering based optimistic multigranulation rough set and a covering based pessimistic multigranulation rough sets. Finally, we develop some properties and several uncertainty measures of the covering based multigranulation rough sets. These results will enrich the MGRS theory and enlarge its application scope.