An empirical comparison of probability estimation techniques for probabilistic rules

10Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Rule learning is known for its descriptive and therefore comprehensible classification models which also yield good class predictions. However, in some application areas, we also need good class probability estimates. 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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sulzmann, J. N., & Fürnkranz, J. (2009). An empirical comparison of probability estimation techniques for probabilistic rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5808 LNAI, pp. 317–331). https://doi.org/10.1007/978-3-642-04747-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free