Confusion matrix in binary classification problems : a step-by-step tutorial

Abstract EN

In the field of machine learning, the confusion matrix is a specific table adopted to describe and assess the performance of a classification model (E.G.

an artificial neural network) for a set of test data whose actual distinguishing features are known.

the learning algorithm is thus of the supervised learning category.

for an n-class classification problem, the confusion matrix is square with n rows and n columns.

the rows represent the class actual samples (instances) which are the inputs to the classifier, while the columns represent the class predicted samples, the classifier outputs.

(the converse is also valid, I.E.

the two dimensions 'actual' and 'predicted' can be assigned to columns and rows, respectively).

binary as well as multiple-class classifiers can be dealt with.

it is worth noting that the term 'matrix' here has nothing to do with the theorems of matrix algebra ; it is regarded just as an information-conveying table.

the descriptive word ‘confusion’ stems from the fact that the matrix clarifies to what extent the model confuses the classes-mislabels one as another.

the essential concept was introduced in 1904 by the British statistician Karl Pearson (1857-1936).