Sciweavers

Share
208 search results - page 1 / 42
» Rough Set Approximation Based on Dynamic Granulation
Sort
View
RSFDGRC
2005
Springer
133views Data Mining» more  RSFDGRC 2005»
9 years 9 months ago
Rough Set Approximation Based on Dynamic Granulation
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is deļ¬ned. Some properties o...
Jiye Liang, Yuhua Qian, Chengyuan Chu, Deyu Li, Ju...
IEEEICCI
2006
IEEE
9 years 9 months ago
Rough Set Method Based on Multi-Granulations
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on universe. In the view of granular computing, classical ro...
Y. H. Qian, J. Y. Liang
ASIAMS
2007
IEEE
9 years 10 months ago
Rough-Fuzzy Granulation, Rough Entropy and Image Segmentation
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
Sankar K. Pal
KBS
2008
98views more  KBS 2008»
9 years 2 months ago
Mixed feature selection based on granulation and approximation
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
Qinghua Hu, Jinfu Liu, Daren Yu
TSMC
2010
8 years 10 months ago
Incomplete Multigranulation Rough Set
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
Yuhua Qian, Jiye Liang, Chuangyin Dang
books