Maximilian Graf
The Laplacian Eigenmaps algorithm as a non-linear dimensionality reduction method was introduced by Belkin and Niyogi in 2001. Key objects are the Graph-Laplace-Matrix and the related Point-Cloud-Laplace-Operator, which can be seen as an approximation of the Laplacian on a manifold, the Laplace-Beltrami-Operator. I will sketch a proof of how its eigenspaces can be approximated by those of the Point-Cloud-Laplacian and how this motivates the Laplacian Eigenmaps algorithm.
Zoom link on request
