Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Estimating Class Probabilities in Random Forests
Stockholm University, Faculty of Social Sciences, Department of Computer and Systems Sciences.
2007 (English)In: Proceedings of the Sixth International Conference on Machine Learning and Applications, IEEE , 2007, 211-216 p.Conference paper, Published paper (Refereed)
Abstract [en]

For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in each leaf to avoid anomalies caused by small sample sizes. The effect of such corrections in random forests of PETs is investigated, and the use of the relative class frequency is compared to using two corrected estimates, the Laplace estimate and the m-estimate. An experiment with 34 datasets from the UCI repository shows that estimating class probabilities using relative class frequency clearly outperforms both using the Laplace estimate and the m-estimate with respect to accuracy, area under the ROC curve (AUC) and Brier score. Hence, in contrast to what is commonly employed for PETs and ensembles of PETs, these results strongly suggest that a non-corrected probability estimate should be used in random forests of PETs. The experiment further shows that learning random forests of PETs using relative class frequency significantly outperforms learning random forests of classification trees (i.e., trees for which only an unweighted vote on the most probable class is counted) with respect to both accuracy and AUC, but that the latter is clearly ahead of the former with respect to Brier score.

Place, publisher, year, edition, pages
IEEE , 2007. 211-216 p.
National Category
Information Science
Identifiers
URN: urn:nbn:se:su:diva-37838DOI: 10.1109/ICMLA.2007.64ISBN: 978-0-7695-3069-7 (print)OAI: oai:DiVA.org:su-37838DiVA: diva2:305369
Conference
Machine Learning and Applications, 2007. ICMLA 2007. Sixth International Conference on 13-15 Dec. 2007
Available from: 2010-03-23 Created: 2010-03-23 Last updated: 2011-06-28Bibliographically approved

Open Access in DiVA

fulltext(134 kB)1137 downloads
File information
File name FULLTEXT01.pdfFile size 134 kBChecksum SHA-512
f417824e009e82a78c4933899363dc0202b6f1e9c60a98bcc7d2d16dfb39341e65e83a85f0feea0c5ff00a85ad1e815a4dd237f30388aa7876a7e5c777acfc70
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Boström, Henrik
By organisation
Department of Computer and Systems Sciences
Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1137 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 79 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf