Abstract

Abstract Locality preserving projection (LPP) is a classical tool for dimensionality reduction and feature extraction. It usually makes use of the l2-norm criterion for optimization, and is thus sensitive to outliers. In order to achieve robustness, LPP-L1 is proposed by employing the l1-norm as distance criterion. However, the edge weights of LPP-L1 measure only the dissimilarity of pairs of vertices and ignore the preservation of the similarity. In this paper, we develop a novel algorithm, termed as ILPP-L1, in which the l1-norm is utilized to obtain robustness and the similarities of pairs of vertices are effectively preserved, simultaneously. ILPP-L1 is robust to outliers because of the use of the l1-norm. The l1-norm minimization problem is directly solved, which ensures the preservation of the similarity of pairs of vertices. The solution is justified to converge to local minimum. In addition, ILPP-L1 avoids small sample size problem. Experiment results on benchmark databases confirm the effectiveness of the proposed method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.