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
β¦ LIBER β¦
Rough sets and ordinal reducts
β Scribed by John W. T. Lee; Daniel S. Yeung; Eric C. C. Tsang
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 302 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1432-7643
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Approximations and reducts with covering
β
Eric C.C. Tsang; Chen Degang; Daniel S. Yeung
π
Article
π
2008
π
Elsevier Science
π
English
β 327 KB
Rough sets and fuzzy sets
β
ZdzisΕaw Pawlak
π
Article
π
1985
π
Elsevier Science
π
English
β 143 KB
In this note we compare notions of rough set and fuzzy set, and we show that these two notions are different.
Control approach to rough set reduction
β
Yunfei Yin; Guanghong Gong; Liang Han
π
Article
π
2009
π
Elsevier Science
π
English
β 897 KB
## a b s t r a c t Rough Set reduction is a typical iterative process; however, the user cannot give extra controls and preferences during the consecutively iterative process. In this paper, we propose a novel approach to Rough Set reduction by using control science viewpoint. In this model, inform
Analysis on attribute reduction strategi
β
Jue Wang; Duoqian Miao
π
Article
π
1998
π
Springer
π
English
β 239 KB
Representation of Ordinal Numbers and De
β
Frederick Bagemihl
π
Article
π
1981
π
John Wiley and Sons
π
English
β 242 KB
Tabu search for attribute reduction in r
β
Abdel-Rahman Hedar; Jue Wang; Masao Fukushima
π
Article
π
2007
π
Springer
π
English
β 231 KB