Linear classifier
In the field of machine learning, the goal of statistical classification is to use an object's characteristics to identify which class (or group) it belongs to. A linear classifier achieves this by making a classification decision based on the value of a linear combination of the characteristics. An object's characteristics are also known as feature values and are typically presented to the machine in a vector called a feature vector. Such classifiers work well for practical problems such as document classification, and more generally for problems with many variables (features), reaching accuracy levels comparable to non -linear classifiers while taking less time to train and use. Definition. If the input feature vector to the classifier is a real vector formula_1, then the output score is where formula_3 is a real vector of weights and "f" is a function that converts the dot product of the two vectors into the desired output. (In other words, formula_4 is a one-form or linear functional mapping formula_1 onto R.) The weight vector formula_6 is learned from a set of labeled training samples. Often "f" is a threshold function, which maps all values of formula_7 above a certain threshold to  the first class and all other values to the second class; e.g., The superscript T indicates the transpose and formula_9 is a scalar threshold. A more complex "f" might give the probability that an item belongs to a certain class. For a two-class classification problem, one can visualize the operation of a linear classifier as splitting a high-dimensional input space with a hyperplane: all points on one side of the hyperplane are classified as "yes", while the others are classified as "no". A linear classifier is often used in situations where the speed of classification is an issue , since it is often the fastest classifier, especially when formula_1 is sparse. Also, linear classifiers often work very well when the number of dimensions in formula_1 is large, as in document classification, where each element in formula_1 is typically the number of occurrences of a word in a document (see document-term matrix). In such cases, the classifier should be well-regularized. Generative models vs. discriminative models. There are two broad classes of methods for determining the parameters of a linear classifier formula_6. They can be generative and discriminative models. Methods of the former model joint probability distribution, whereas methods  of the latter model conditional density functions formula_14. Examples of such algorithms include: The second set of methods includes discriminative models, which attempt to maximize the quality of the output on a training set. Additional terms in the training cost function can easily perform regularization of the final model. Examples of discriminative training of linear classifiers include: Note: Despite its name, LDA does not belong to the class of discriminative models in this taxonomy. However, its name makes sense when we compare LDA to the other main linear dimensionality reduction algorithm: principal components analysis (PCA). LDA is a supervised learning  algorithm that utilizes the labels of the data, while PCA is an unsupervised learning algorithm that ignores the labels. To summarize, the name is a historical artifact. Discriminative training often yields higher accuracy than modeling the conditional density functions. However, handling missing data is often easier with conditional density models. All of the linear classifier algorithms listed above can be converted into non-linear algorithms operating on a different input space formula_16, using the kernel trick. Discriminative training. Discriminative training of linear classifiers usually proceeds in a supervised way, by means of an optimization algorithm that is given a training  set with desired outputs and a loss function that measures the discrepancy between the classifier's outputs and the desired outputs. Thus, the learning algorithm solves an optimization problem of the form where Popular loss functions include the hinge loss (for linear SVMs) and the log loss (for linear logistic regression). If the regularization function is convex, then the above is a convex problem. Many algorithms exist for solving such problems; popular ones for linear classification include (stochastic) gradient descent, L-BFGS, coordinate descent and Newton methods.