Sulzmann, Jan-Nikolas ; Fürnkranz, Johannes (2010)
Rule Stacking: An approach for compressing an ensemble of rule sets into a single classifier.
Report, Bibliographie
Kurzbeschreibung (Abstract)
In this paper, we present an approach for compressing a rule-based pairwise classifier ensemble into a single rule set that can be directly used for classification. The key idea is to re-encode the training examples using information about which of the original ruler covers the example, and to use them for training a rule-based meta-level classifier. We not only show that this approach is more accurate than using the same classifier at the base level (which could have been expected for such a variant of stacking), but also demonstrate that the resulting meta-level rule set can be straight-forwardly translated back into a rule set at the base level. Our key result is that the rule sets obtained in this way are of comparable complexity to those of the original rule learner, but considerably more accurate.
| Typ des Eintrags: | Report |
|---|---|
| Erschienen: | 2010 |
| Autor(en): | Sulzmann, Jan-Nikolas ; Fürnkranz, Johannes |
| Art des Eintrags: | Bibliographie |
| Titel: | Rule Stacking: An approach for compressing an ensemble of rule sets into a single classifier |
| Sprache: | Englisch |
| Publikationsjahr: | 2010 |
| URL / URN: | http://www.ke.tu-darmstadt.de/publications/reports/tud-ke-20... |
| Kurzbeschreibung (Abstract): | In this paper, we present an approach for compressing a rule-based pairwise classifier ensemble into a single rule set that can be directly used for classification. The key idea is to re-encode the training examples using information about which of the original ruler covers the example, and to use them for training a rule-based meta-level classifier. We not only show that this approach is more accurate than using the same classifier at the base level (which could have been expected for such a variant of stacking), but also demonstrate that the resulting meta-level rule set can be straight-forwardly translated back into a rule set at the base level. Our key result is that the rule sets obtained in this way are of comparable complexity to those of the original rule learner, but considerably more accurate. |
| ID-Nummer: | TUD-KE-2010-05 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik > Knowledge Engineering 20 Fachbereich Informatik |
| Hinterlegungsdatum: | 24 Jun 2011 14:12 |
| Letzte Änderung: | 05 Mär 2013 09:49 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum