Probabilistic Random Forests: Predicting Data Point Specific Misclassification Probabilities

Probabilistic Random Forests: Predicting Data Point Specific Misclassification Probabilities

Cached

Download Links

[www.cs.colorado.edu]

by Markus Breitenbach , Gregory Z. Grudic , Rodney Nielsen

BibTeX

@MISC{Breitenbach_probabilisticrandom,
    author = {Markus Breitenbach and Gregory Z. Grudic and Rodney Nielsen},
    title = {Probabilistic Random Forests: Predicting Data Point Specific Misclassification Probabilities},
    year = {}
}

Bookmark

OpenURL

Abstract

Recently proposed classification algorithms give estimates or worst-case bounds for the probability of misclassification [Lanckriet et al., 2002][L.

Citations

6694	Statistical Learning Theory - Vapnik - 1998
3143	Classification and Regression Trees - Breiman, Friedman, et al. - 1983
2529	C.J.E.: Uci repository of machine learning databases, http://www.ics.uci.edu/ ∼ mlearn/MLRepository.html - Blake, Keogh
785	Random forests - Breiman - 2001
435	Schapire R: A short introduction to boosting - Freund - 1999
380	Sparse Bayesian learning and the Relevance Vector Machine - Tipping
369	A comparison of methods for multiclass support vector - Hsu
87	Fast sparse Gaussian Process method: Informative vector machines. NIPS - Lawrence, Seeger, et al. - 2002
53	Comparison of classifier methods: a case study in handwritten digit recognition - Bottou, Cortes, et al. - 1994
47	A robust minimax approach to classification - Lanckriet, Ghaoui, et al. - 2002
37	Arcing Classifiers,” The Annals of Statistics - Breiman - 1998
15	Classification into two multivariate normal distributions with different covariance matrices - Anderson, Bahadur - 1962
1	Sparse Greedy MPM Classification - Strohmann, Belitski, et al. - 2003
1	Random forests readme file - Breiman