Linear Classifier Techniques

Abstract

Linear classifier techniques involve identifying the hyperplane that separates between the classes. The vector under test is treated as the one belonging to the particular class k if it is near to centroid of the k ^th class (Nearest Mean). The r vectors nearest to the vector under test is considered. Among r vectors, if the vector under consideration is nearest to maximum number of vectors belonging to the particular (say k ^th class, then the vector under test is declared as the one belonging to the k ^th class (Nearest Neighbour). The Support Vector Machine is used to identify the equation of the hyperplane that partitions two classes. This is achieved by using the vectors mapped to the higher dimensional space without explicit mapping to the higher dimensional space using “kernel trick.” With modification in the objective functions and the constraints, Support Vector Machine is used for regression techniques. The coefficients describing the equation of the hyperplane are assumed as Gaussian distributed with nonidentical diagonal co-variance matrix and are estimated using Relevance vector machine (RSVM). This helps to get sparse coefficients. RSVM is also used for the classification technique.