作者
Eric CC Tsang, Chen Degang, Daniel S Yeung
发表日期
2008/7/31
期刊
Computers & Mathematics with applications
卷号
56
期号
1
页码范围
279-289
出版商
Pergamon
简介
The covering generalized rough sets are an improvement of traditional rough set model to deal with more complex practical problems which the traditional one cannot handle. It is well known that any generalization of traditional rough set theory should first have practical applied background and two important theoretical issues must be addressed. The first one is to present reasonable definitions of set approximations, and the second one is to develop reasonable algorithms for attributes reduct. The existing covering generalized rough sets, however, mainly pay attention to constructing approximation operators. The ideas of constructing lower approximations are similar but the ideas of constructing upper approximations are different and they all seem to be unreasonable. Furthermore, less effort has been put on the discussion of the applied background and the attributes reduct of covering generalized rough sets. In …
引用总数
200920102011201220132014201520162017201820192020202120222023202449111914101010136111712531
学术搜索中的文章
ECC Tsang, C Degang, DS Yeung - Computers & Mathematics with Applications, 2008