Abstract
In the paper, we present an algorithm for optimization of approximate decision rules relative to the number of misclassifications. The considered algorithm is based on extensions of dynamic programming and constructs a directed acyclic graph Δ β (T). Based on this graph we can describe the whole set of so-called irredundant β-decision rules. We can optimize rules from this set according to the number of misclassifications. Results of experiments with decision tables from the UCI Machine Learning Repository are presented. © 2012 Springer-Verlag.
Original language | English (US) |
---|---|
Title of host publication | Computational Collective Intelligence. Technologies and Applications |
Publisher | Springer Nature |
Pages | 345-354 |
Number of pages | 10 |
ISBN (Print) | 9783642347061 |
DOIs | |
State | Published - 2012 |
Bibliographical note
KAUST Repository Item: Exported on 2020-10-01ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science