TU Darmstadt / ULB / TUbiblio

Probability Estimation and Aggregation for Rule Learning

Sulzmann, Jan-Nikolas and Fürnkranz, Johannes (2010):
Probability Estimation and Aggregation for Rule Learning.
[Online-Edition: http://www.ke.tu-darmstadt.de/publications/reports/tud-ke-20...],
[Report]

Abstract

Rule learning is known for its descriptive and therefore comprehensible classification models which also yield good class predictions. For different classification models, such as decision trees, a variety of techniques for obtaining good probability estimates have been proposed and evaluated. However, so far, there has been no systematic empirical study of how these techniques can be adapted to probabilistic rules and how these methods affect the probability-based rankings. In this paper we apply several basic methods for the estimation of class membership probabilities to classification rules. We also study the effect of a shrinkage technique for merging the probability estimates of rules with those of their generalizations. Finally, we compare different ways of combining probability estimates from an ensemble of rules. Our results show that for probability estimation it is beneficial to exploit the fact that rules overlap (i.e., rule averaging is preferred over rule sorting), and that individual probabilities should be combined at the level of rules and not at the level of theories.

Item Type: Report
Erschienen: 2010
Creators: Sulzmann, Jan-Nikolas and Fürnkranz, Johannes
Title: Probability Estimation and Aggregation for Rule Learning
Language: English
Abstract:

Rule learning is known for its descriptive and therefore comprehensible classification models which also yield good class predictions. For different classification models, such as decision trees, a variety of techniques for obtaining good probability estimates have been proposed and evaluated. However, so far, there has been no systematic empirical study of how these techniques can be adapted to probabilistic rules and how these methods affect the probability-based rankings. In this paper we apply several basic methods for the estimation of class membership probabilities to classification rules. We also study the effect of a shrinkage technique for merging the probability estimates of rules with those of their generalizations. Finally, we compare different ways of combining probability estimates from an ensemble of rules. Our results show that for probability estimation it is beneficial to exploit the fact that rules overlap (i.e., rule averaging is preferred over rule sorting), and that individual probabilities should be combined at the level of rules and not at the level of theories.

Divisions: 20 Department of Computer Science > Knowl­edge En­gi­neer­ing
20 Department of Computer Science
Date Deposited: 24 Jun 2011 14:09
Official URL: http://www.ke.tu-darmstadt.de/publications/reports/tud-ke-20...
Identification Number: TUD-KE-2010-03
Export:

Optionen (nur für Redakteure)

View Item View Item