A kernel view of the dimensionality reduction of manifolds

  • Authors:
  • Jihun Ham;Daniel D. Lee;Sebastian Mika;Bernhard Schölkopf

  • Affiliations:
  • University of Pennsylvania, Philadelphia, PA;University of Pennsylvania, Philadelphia, PA;Fraunhofer FIRST.IDA, Berlin, Germany;Max Planck Institute for Biological Cybernetics, Tübingen, Germany

  • Venue:
  • ICML '04 Proceedings of the twenty-first international conference on Machine learning
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We interpret several well-known algorithms for dimensionality reduction of manifolds as kernel methods. Isomap, graph Laplacian eigenmap, and locally linear embedding (LLE) all utilize local neighborhood information to construct a global embedding of the manifold. We show how all three algorithms can be described as kernel PCA on specially constructed Gram matrices, and illustrate the similarities and differences between the algorithms with representative examples.