Robust locality preserving projections with cosine-based dissimilarity for linear dimensionality reduction

Qiang Yu, Rong Wang, Bing Nan Li, Xiaojun Yang, Minli Yao

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

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.

Original languageEnglish
Article number7604144
Pages (from-to)2676-2684
Number of pages9
JournalIEEE Access
Volume5
DOIs
StatePublished - 2017
Externally publishedYes

Keywords

  • complex kernel
  • dimensionality reduction
  • euler mapping
  • Locality preserving projections (LPP)
  • robust

Fingerprint

Dive into the research topics of 'Robust locality preserving projections with cosine-based dissimilarity for linear dimensionality reduction'. Together they form a unique fingerprint.

Cite this