Skip to content

Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

Mikhail Belkin, Partha Niyogi

Neural Computation · 2003 · 7,747 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Belkin, M., & Niyogi, P. (2003). Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6), 1373–1396. https://doi.org/10.1162/089976603321780317

In text: (Belkin & Niyogi, 2003)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

One of the central problems in machine learning and pattern recognition is to develop appropriate representations for complex data. We consider the problem of constructing a representation for data lying on a low-dimensional manifold embedded in a high-dimensional space. Drawing on the correspondence between the graph Laplacian, the Laplace Beltrami operator on the manifold, and the connections to the heat equation, we propose a geometrically motivated algorithm for representing the high-dimensional data. The algorithm provides a computationally efficient approach to nonlinear dimensionality reduction that has locality-preserving properties and a natural connection to clustering. Some potential applications and illustrative examples are discussed.

  1. Regularization and Variable Selection Via the Elastic Net2005
  2. Reducing the Dimensionality of Data with Neural Networks2006
  3. Nonlinear Dimensionality Reduction by Locally Linear Embedding2000
  4. Representation Learning: A Review and New Perspectives2013
  5. Eigenfaces for Recognition1991

Metadata from OpenAlex (CC0). Citations are generated from the published record.