In statistical classification, Bayes error rate is the lowest possible error rate for any classifier of a random outcome (into, for example, one of two categories) and is analogous to the irreducible error.^[1][2]

A number of approaches to the estimation of the Bayes error rate exist. One method seeks to obtain analytical bounds which are inherently dependent on distribution parameters, and hence difficult to estimate. Another approach focuses on class densities, while yet another method combines and compares various classifiers.^[2]

The Bayes error rate finds important use in the study of patterns and machine learning techniques.^[3]

Error determination

In terms of machine learning and pattern classification, the labels of a set of random observations can be divided into 2 or more classes. Each observation is called an instance and the class it belongs to is the label. The Bayes error rate of the data distribution is the probability an instance is misclassified by a classifier that knows the true class probabilities given the predictors.

For a multiclass classifier, the expected prediction error may be calculated as follows:^[3]

${\displaystyle EPE=E_{x}[\sum _{k=1}^{K}L(C_{k},{\hat {C}}(x))P(C_{k}|x)]}$

where x is the instance, ${\displaystyle E[]}$ the expectation value, C_k is a class into which an instance is classified, P(C_k|x) is the conditional probability of label k for instance x, and L() is the 0–1 loss function:

${\displaystyle L(x,y)=1-\delta _{x,y}={\begin{cases}0&{\text{if }}x=y\\1&{\text{if }}x\neq y\end{cases}},}$

where ${\displaystyle \delta _{x,y}}$ is the Kronecker delta.

When the learner knows the conditional probability, then one solution is:

${\displaystyle {\hat {C}}_{B}(x)=\arg \max _{k\in \{1...K\}}P(C_{k}|X=x)}$

This solution is known as the Bayes classifier.

The corresponding expected Prediction Error is called the Bayes error rate:

${\displaystyle BE=E_{x}[\sum _{k=1}^{K}L(C_{k},{\hat {C}}_{B}(x))P(C_{k}|x)]=E_{x}[\sum _{k=1,\ C_{k}\neq {\hat {C}}_{B}(x)}^{K}P(C_{k}|x)]=E_{x}[1-P({\hat {C}}_{B}(x)|x)]}$,

where the sum can be omitted in the last step due to considering the counter event. By the definition of the Bayes classifier, it maximizes ${\displaystyle P({\hat {C}}_{B}(x)|x)}$ and, therefore, minimizes the Bayes error BE.

The Bayes error is non-zero if the classification labels are not deterministic, i.e., there is a non-zero probability of a given instance belonging to more than one class.^[4] In a regression context with squared error, the Bayes error is equal to the noise variance.^[3]

Proof of Minimality

Proof that the Bayes error rate is indeed the minimum possible and that the Bayes classifier is therefore optimal, may be found together on the Wikipedia page Bayes classifier.

Plug-in Rules for Binary Classifiers

A plug-in rule uses an estimate of the posterior probability ${\displaystyle \eta }$ to form a classification rule. Given an estimate ${\displaystyle {\tilde {\eta }}}$, the excess Bayes error rate of the associated classifier is bounded above by:

$${\displaystyle 2\mathbb {E} [|\eta (X)-{\tilde {\eta }}(X)|].}$$

To see this, note that the excess Bayes error is equal to 0 where the classifiers agree, and equal to ${\displaystyle 2|\eta (X)-1/2|}$ where they disagree. To form the bound, notice that ${\displaystyle {\tilde {\eta }}}$ is at least as far as ${\displaystyle 1/2}$ when the classifiers disagree.

See also

• Naive Bayes classifier

References