Skip to Main Content
An algorithm for pattern classification using eigenvectors is presented. This algorithm provides an alternative viewpoint for obtaining a solution weight vector of certain pattern classification problems. Convergence of the algorithm is proved and the termination condition of iteration is given. An interesting point is that this algorithm does not require the inversion of matrices, instead it requires the computation of eigenvalues and eigenvectors of the matrix.