AI Glossary / Statistics and probability / Intermediate
Probabilistic classification
Definition
Probabilistic classification predicts probabilities for the possible classes of an observation rather than returning only a class label. For a mutually exclusive and exhaustive set of classes, the predicted probabilities are nonnegative and sum to one. A decision rule can then turn them into a label or action. The probabilities express the model's estimated class uncertainty given its inputs and assumptions. Producing probability-shaped numbers does not by itself establish that those numbers are calibrated or accurate.
What it means
Two cases can receive the same most-likely label but have very different uncertainty. A probability vector of 0.95, 0.04 and 0.01 conveys a different situation from 0.36, 0.34 and 0.30, even though the first class wins both times. Those differences can matter for review, ranking or expected-cost decisions. Classification probabilities are conditional on the available features and model. They do not necessarily represent all uncertainty from missing information, model misspecification or a new population outside the training experience.
How it works
Define the class set and whether classes are mutually exclusive or can co-occur. Fit a model using a suitable objective, such as log loss, and obtain probability estimates on observations excluded from fitting. Evaluate discrimination and calibration using appropriate plots and scoring rules. If calibration is needed, fit it with properly separated data and assess it independently. Choose decision thresholds or actions based on the application rather than assuming the largest probability is always the best operational choice. Monitor the model when class prevalence, measurement or case composition changes.
Three practical examples
- Document routing: estimate probabilities across departments and send uncertain cases for review.
- Defect detection: use a failure probability in a decision rule that accounts for the different costs of missed defects and unnecessary checks.
- Customer support: estimate the probabilities of several mutually exclusive request categories, then assess whether high-confidence predictions are as reliable as the system claims.
Think of it this way
Think of distributing one unit of belief across the possible answers instead of circling only one answer. The distribution gives more information, but it must still be checked against outcomes. A model can sound very certain by concentrating probability on one class and still be systematically wrong.
Worked example
Consider an original three-class prediction (0.6,0.3,0.1) for classes A, B and C. Under a highest-probability rule, the predicted label is A. If the observed class is B, the negative log probability assigned to the truth is -ln(0.3), approximately 1.2040. Using the unnormalized multiclass Brier convention that sums squared class errors, the score is 0.6^2 + (0.3-1)^2 + 0.1^2 = 0.86. Software may use different averaging conventions, so the definition should be reported. Separately, consider a binary defect probability of 0.35. If an unnecessary check costs 1 and missing a defect costs 5, with zero cost for correct actions in this simplified loss model, expected loss from checking is 0.65 and from not checking is 1.75. Checking is preferred even though defect is not the most probable class. The corresponding threshold is 1/(1+5), about 0.1667, under those stated assumptions.
Illustrative case study
In a fictional case, Vale Routing evaluates a classifier that returns department probabilities. Its overall accuracy is acceptable, but cases assigned probabilities above 0.9 are correct less often than expected. Analysts inspect calibration on independent data and review category-specific errors. They then establish a review policy based on measured reliability and the consequences of misrouting. The project keeps probability estimation separate from the operational decision rule so either can be revised transparently.
Common misconceptions and mistakes
A softmax output sums to one but is not automatically calibrated. Good ranking or high accuracy does not ensure reliable probability levels. The largest predicted probability need not justify automatic action when error costs are asymmetric. Multilabel problems differ from mutually exclusive multiclass classification: separate label probabilities need not sum to one because several labels may be true simultaneously. A probability near zero is not proof of impossibility. Likewise, a confident prediction on an unfamiliar input can reflect model overconfidence rather than strong evidence.
Business use
Businesses gain flexibility when a classifier provides useful probabilities, because actions can reflect capacity, review costs and the impact of errors. Validate the probabilities in the relevant operating range and population. Report metrics that match the intended use, including calibration and performance on important classes. Keep the class definitions stable or document changes, especially when a catch-all category is revised. Treat review thresholds as decision choices requiring evidence, not intrinsic properties of the model. Monitor whether the probabilities remain meaningful after deployment and after model updates.
People also ask
Does probabilistic classification always require a Bayesian model?
No. Many non-Bayesian training procedures produce class-probability estimates.
Must probabilities sum to one?
For exhaustive mutually exclusive classes, yes; multilabel settings require a different interpretation.
Can two models have the same accuracy but different probability quality?
Yes. They may choose the same labels while assigning very different probabilities to those labels and alternatives.
Check your understanding
A three-class model predicts 0.36, 0.34 and 0.30. Does choosing the first label imply strong certainty?
Answer: No. It is only the largest of three close probabilities, so the prediction remains uncertain under the model.
Related terms
- Classification
- Calibration
- Log Loss
- Brier score
- class probability
- decision threshold
- multiclass classification
- multilabel classification
Learn next
Learn how probability scoring rules differ from label accuracy, then study calibration and decision rules that incorporate the actual consequences of classification errors.
More in Statistics and probability
- Poisson distribution - The Poisson distribution is a probability distribution for a count taking the values 0, 1, 2 and so on.
- Policy capturing - Policy capturing is a research method for describing how people combine information when making judgments or decisions.
- Poly-Weibull distribution - The poly-Weibull distribution is a continuous time-to-event distribution constructed by adding several Weibull-type hazard functions.
- Pólya urn model - A Pólya urn model is a probability model in which sampling changes the probabilities of future samples through a specified reinforcement rule.
- Polynomial regression - Polynomial regression models an outcome using powers of one or more numerical predictors.
- Polynomial trend coefficient - A polynomial trend coefficient is a numerical weight used with other such weights to test a specified trend across ordered group means.
Sources
Scikit-learn, Probability calibration: https://scikit-learn.org/stable/modules/calibration.html Vaicenavicius and colleagues, Evaluating model calibration in classification: https://arxiv.org/abs/1902.06977
Previous: Probabilistic circuit Next: Probabilistic context-free grammar