Name
Abstract | ||
|---|---|---|
In this paper we consider multiple criteria decision aid systems based on decision rules generated from examples. A common problem in such systems is the over-abundance of decision rules, as in many situations the rule generation algorithms produce very large sets of rules. This prolific representation of knowledge provides a great deal of detailed information about the described objects, but is appropriately difficult to interpret and use. One way of solving this problem is to aggregate the created rules into more general ones, e.g. by forming rules of enriched syntax. The paper presents a generalization of elementary rule conditions into linear combinations. This corresponds to partitioning the preference-ordered condition space of criteria with non-orthogonal hyperplanes. The objective of this paper is to introduce the generalized rules into the multiple criteria classification problems and to demonstrate that these problems can be successfully solved using the introduced rules. The usefulness of the introduced solution is finally demonstrated in computational experiments with real-life data sets. |
Year | Venue | Keywords |
|---|---|---|
2004 | Fundam. Inform. | hyperplane aggregation,enriched syntax,detailed information,decision rule,elementary rule condition,dominance decision rules,multiple criteria classification problem,common problem,computational experiment,generalized rule,multiple criteria decision aid,rule generation algorithm,rough sets |
Field | DocType | Volume |
Decision rule,Linear combination,Data set,Computer science,Rough set,Artificial intelligence,Rule induction,Hyperplane,Syntax,Machine learning,Production Rule Representation | Journal | 61 |
Issue | ISSN | Citations |
2 | 0169-2968 | 9 |
PageRank | References | Authors |
1.02 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Pindur | 1 | 64 | 3.68 |
| Robert Susmaga | 2 | 370 | 33.32 |
| Jerzy Stefanowski | 3 | 1653 | 139.25 |