Robust projection twin extreme learning machines with capped L1-norm distance metric

In this paper, we incorporate the idea of projection twin support vector machines (PTSVM) into the basic framework of twin extreme learning machines (TELM) and first propose a novel binary classifier named projection twin extreme learning machines (PTELM). PTELM is to seek two projection directions in the TELM feature space, such that the projected samples of one class are well separated from those of the other class. Compared with the PTSVM, PTELM tackles nonlinear cases without using several fixed kernel functions, thus PTELM is less sensitive to use specified parameters and can get better classification accuracy. Then, a new capped -norm PTELM (C-PTELM) is proposed by introducing capped -norm distance metric in PTELM to reduce the effect of outliers. C-PTELM overcomes the disadvantages of -norm distance metric and hinge loss. Thus, C-PTELM enhances the robust performance of our PTELM. Finally, two effective algorithms are designed to solve the problem of PTELM and to deal with the challenge of C-PTELM brought by non-convex optimization problem, respectively. Simultaneously, we theoretically prove the convergence and local optimality of C-PTELM algorithm. Numerical experiments on three synthetic datasets and several UCI datasets show the feasibility and effectiveness of our proposed methods.