ABSTRACT Locality preserving projection (LPP) is a classical tool for dimensionality reduction problems. However, it is sensitive to outliers because of utilizing the 2 -norm-based distance criterion. In this paper, we propose a new approach, termed Euler-LPP, by preserving the local structures of data under the distance criterion of the cosine-based dissimilarity. Euler-LPP is robust to outliers in that the cosine-based dissimilarity suppresses the influence of outliers more efficiently than the 2 -norm. An explicit mapping, defined by a complex kernel (euler kernel) is adopted to map the data from the input space to complex reproducing kernel Hilbert spaces (CRKHSs), in which the distance of the data pairs under the 2 -norm is equal to that in the input space under the cosine-based dissimilarity. Thus, the robust dimensionality problem can be directly solved in CRKHS, where the solution is guaranteed to converge to a global minimum. In addition, Euler-LPP is easy to implement without significantly increasing computational complexity. Experiment results on several benchmark databases confirm the effectiveness of the proposed method. INDEX TERMS Locality preserving projections (LPP), complex kernel, dimensionality reduction, robust, euler mapping
Moreover, Qiang Yu presented Euler-locality preserving projection (LPP) approach for dimensionality reduction and the experiment is conducted on the face dataset REF .
Robust Locality Preserving Projections With Cosine-Based Dissimilarity for Linear Dimensionality Reduction
IEEE Access
IEEE Access
Mathematics Computer Science