The kernel minimum square error classification (KMSEC) algorithm has been widely used in classification problems. It shows a good performance on image data besides the following drawbacks: not sparse in the solutions and sensitive to noises. The latter drawback will result in a decrease in the recognition performance. To this end, we propose an improved (IKMSEC) by using the L2,1-norm regularization, which can obtain a sparse representation of nonlinear features to guarantee an efficient classification performance. The comprehensive experiments show the promising results in face recognition and image