Nonlinear dimensionality reduction with relative distance comparison

  • Authors:
  • Chunxia Zhang;Shiming Xiang;Feiping Nie;Yangqiu Song

  • Affiliations:
  • Software School, School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China;National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China;Department of Automation, Tsinghua National Laboratory for Information Science and Technology (TNList), Tsinghua University, Beijing 100084, China;Department of Automation, Tsinghua National Laboratory for Information Science and Technology (TNList), Tsinghua University, Beijing 100084, China

  • Venue:
  • Neurocomputing
  • Year:
  • 2009

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper proposes a new algorithm for nonlinear dimensionality reduction. Our basic idea is to explore and exploit the local geometry of the manifold with relative distance comparisons. All such comparisons derived from local neighborhoods are enumerated to constrain the manifold to be learned. The task is formulated as a problem of quadratically constrained quadratic programming (QCQP). However, such a QCQP problem is not convex. We relax it to be a problem of semi-definite programming (SDP), from which a globally optimal embedding is obtained. Experimental results illustrate the validity of our algorithm.