Skip to main content

Binary Classification

Binary Classifiication is the most classic problem in ML.

Binary Classification solves the problem,

xiRn,yiB,i=1,2,,nx_i \in \mathbb{R}^n, y_i \in \mathbb{B}, i = 1, 2, \ldots, n

Where B={0,1}\mathbb{B} = \{0,1\} or sometimes, B={1,1}\mathbb{B} = \{-1,1\}.

And a train dataset,

D={(x1,y1),(x2,y2),,(xn,yn)}\mathcal{D} = \{(x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\}

Finds the best fit ff for,

y^=f(x)\hat{y} = f(x)

By best fit, we typically mean to minimize a loss value. Depending on the algorithm, the loss function can be different. However, for binary classification, there are also some method based on rules, what we call the covering algorithm.