Name
Abstract | ||
|---|---|---|
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 extension of the Classic Rough Sets Approach, called the Dominance-based Rough Sets Approach, was introduced. The final result of the analysis is a set of decision rules induced from what is called rough approximations of decision classes. The main role of the induced decision rules is to discover regularities in the analyzed data set, but the same rules, when combined with a particular classification method, may also be used to classify/sort new objects (i.e. to assign the objects to appropriate classes). There exist many different rule induction strategies, including induction of an exhaustive set of rules. This strategy produces the most comprehensive knowledge base on the analyzed data set, but it requires a considerable amount of computing time, as the complexity of the process is exponential. In this paper we present a shortcut that allows classifying new objects without generating the rules. The presented approach bears some resemblance to the idea of lazy learning. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S1571-0661(04)80708-4 | Electronic Notes in Theoretical Computer Science |
Keywords | DocType | Volume |
Dominance-based Rough Set Approach,Multiple-criteria decision support,Knowledge Discovery,decision rules | Journal | 82 |
Issue | ISSN | Citations |
4 | 1571-0661 | 22 |
PageRank | References | Authors |
0.91 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krzysztof Dembczyński | 1 | 594 | 31.78 |
| Roman Pindur | 2 | 64 | 3.68 |
| Robert Susmaga | 3 | 370 | 33.32 |