Rough Sets Theory is often applied to the task of classification and prediction, in which objects are assigned to some pre-defined decision classes. When the classes are preference-ordered, the process of classification is referred to as sorting. To deal with the specificity of sorting problems an e
β¦ LIBER β¦
Rough set based rule induction from two decision tables
β Scribed by Masahiro Inuiguchi; Takuya Miyajima
- Book ID
- 108118076
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 278 KB
- Volume
- 181
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Dominance-based Rough Set Classifier wit
β
Krzysztof DembczyΕski; Roman Pindur; Robert Susmaga
π
Article
π
2003
π
Elsevier Science
π
English
β 713 KB
Converse approximation and rule extracti
β
Yuhua Qian; Jiye Liang; Chuangyin Dang
π
Article
π
2008
π
Elsevier Science
π
English
β 278 KB
In this paper, the concept of a granulation order is proposed in an information system. The converse approximation of a target concept under a granulation order is defined and some of its important properties are obtained, which can be used to characterize the structure of a set approximation. For a
Incremental Induction of Decision Rules
β
Jerzy BΕaszczyΕski; Roman SΕowiΕski
π
Article
π
2003
π
Elsevier Science
π
English
β 789 KB
A Rough-Set-Based Approach for Classific
β
L. P. Khoo; S. B. Tor; L. Y. Zhai
π
Article
π
1999
π
Springer
π
English
β 83 KB
Rule Induction with Grouping Target Conc
β
Shusaku Tsumoto
π
Article
π
2003
π
Elsevier Science
π
English
β 816 KB