Multiclass classification

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Not to be confused with multi-label classification.

In machine learning, multiclass or multinomial classification is the problem of classifying instances into more than two classes.

While some classification algorithms naturally permit the use of more than two classes, others are by nature binary algorithms; these can, however, be turned into multinomial classifiers by a variety of strategies.

Multiclass classification should not be confused with multi-label classification, where multiple labels are to be predicted for each instance.

General strategies[edit]


Among these strategies are the one-vs.-all (or one-vs.-rest, OvA or OvR) strategy, where a single classifier is trained per class to distinguish that class from all other classes. Prediction is then performed by predicting using each binary classifier, and choosing the prediction with the highest confidence score (e.g., the highest probability of a classifier such as naive Bayes).

In pseudocode, the training algorithm for an OvA learner constructed from a binary classification learner L is as follows:

  • L, a learner (training algorithm for binary classifiers)
  • samples X
  • labels y where yᵢ ∈ {1, … K} is the label for the sample Xᵢ
  • a list of classifiers fk for k ∈ {1, … K}
  • For each k in {1 … K}:
    • Construct a new label vector yᵢ' = 1 where yᵢ = k, 0 (or -1) elsewhere
    • Apply L to X, y' to obtain fk

Making decisions proceeds by applying all classifiers to an unseen sample x and predicting the label k for which the corresponding classifier reports the highest confidence score:

\hat{y} = \arg\max_{k \in 1 \ldots K} f_k(x)

See also[edit]