# Probabilistic classification

In machine learning, a **probabilistic classifier** is a classifier that is able to predict, given an observation of an input, a probability distribution over a set of classes, rather than only outputting the most likely class that the observation should belong to. Probabilistic classifiers provide classification that can be useful in its own right[1] or when combining classifiers into ensembles.

Machine learning and data mining |
---|

Machine-learning venues |

## Types of classification

Formally, an "ordinary" classifier is some rule, or function, that assigns to a sample x a class label ŷ:

The samples come from some set X (e.g., the set of all documents, or the set of all images), while the class labels form a finite set Y defined prior to training.

Probabilistic classifiers generalize this notion of classifiers: instead of functions, they are conditional distributions , meaning that for a given , they assign probabilities to all (and these probabilities sum to one). "Hard" classification can then be done using the optimal decision rule[2]^{:39–40}

or, in English, the predicted class is that which has the highest probability.

Binary probabilistic classifiers are also called binomial regression models in statistics. In econometrics, probabilistic classification in general is called discrete choice.

Some classification models, such as naive Bayes, logistic regression and multilayer perceptrons (when trained under an appropriate loss function) are naturally probabilistic. Other models such as support vector machines are not, but methods exist to turn them into probabilistic classifiers.

## Generative and conditional training

Some models, such as logistic regression, are conditionally trained: they optimize the conditional probability directly on a training set (see empirical risk minimization). Other classifiers, such as naive Bayes, are trained generatively: at training time, the class-conditional distribution and the class prior are found, and the conditional distribution is derived using Bayes' rule.[2]^{:43}

## Probability calibration

Not all classification models are naturally probabilistic, and some that are, notably naive Bayes classifiers, decision trees and boosting methods, produce distorted class probability distributions.[3] In the case of decision trees, where Pr(*y*|**x**) is the proportion of training samples with label y in the leaf where **x** ends up, these distortions come about because learning algorithms such as C4.5 or CART explicitly aim to produce homogeneous leaves (giving probabilities close to zero or one, and thus high bias) while using few samples to estimate the relevant proportion (high variance).[4]

Calibration can be assessed using a **calibration plot** (also called a **reliability diagram**).[3][5] A calibration plot shows the proportion of items in each class for bands of predicted probability or score (such as a distorted probability distribution or the "signed distance to the hyperplane" in a support vector machine). Deviations from the identity function indicate a poorly-calibrated classifier for which the predicted probabilities or scores can not be used as probabilities. In this case one can use a method to turn these scores into properly calibrated class membership probabilities.

For the binary case, a common approach is to apply Platt scaling, which learns a logistic regression model on the scores.[6] An alternative method using isotonic regression[7] is generally superior to Platt's method when sufficient training data is available.[3]

In the multiclass case, one can use a reduction to binary tasks, followed by univariate calibration with an algorithm as described above and further application of the pairwise coupling algorithm by Hastie and Tibshirani.[8]

## Evaluating probabilistic classification

Commonly used loss functions for probabilistic classification include log loss and the Brier score between the predicted and the true probability distributions. The former of these is commonly used to train logistic models.

A method used to assign scores to pairs of predicted probabilities and actual discrete outcomes, so that different predictive methods can be compared, is called a scoring rule.

## References

- Hastie, Trevor; Tibshirani, Robert; Friedman, Jerome (2009).
*The Elements of Statistical Learning*. p. 348. Archived from the original on 2015-01-26.[I]n data mining applications the interest is often more in the class probabilities themselves, rather than in performing a class assignment.

- Bishop, Christopher M. (2006).
*Pattern Recognition and Machine Learning*. Springer. - Niculescu-Mizil, Alexandru; Caruana, Rich (2005).
*Predicting good probabilities with supervised learning*(PDF). ICML. doi:10.1145/1102351.1102430. Archived from the original (PDF) on 2014-03-11. - Zadrozny, Bianca; Elkan, Charles (2001).
*Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers*(PDF). ICML. pp. 609–616. - "Probability calibration".
*jmetzen.github.io*. Retrieved 2019-06-18. - Platt, John (1999). "Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods".
*Advances in Large Margin Classifiers*.**10**(3): 61–74. - Zadrozny, Bianca; Elkan, Charles (2002). "Transforming classifier scores into accurate multiclass probability estimates" (PDF).
*Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '02*. pp. 694–699. CiteSeerX 10.1.1.164.8140. doi:10.1145/775047.775151. ISBN 978-1-58113-567-1. CiteSeerX: 10.1.1.13.7457. - Hastie, Trevor; Tibshirani, Robert (1998). "Classification by pairwise coupling".
*The Annals of Statistics*.**26**(2): 451–471. CiteSeerX 10.1.1.309.4720. doi:10.1214/aos/1028144844. Zbl 0932.62071. CiteSeerX: 10.1.1.46.6032.