Laplacian-Based Dimensionality Reduction Including Spectral Clustering, Laplacian Eigenmap, Locality Preserving Projection, Graph Embedding, and Diffusion Map: Tutorial and Survey
It serves as a comprehensive resource for researchers and practitioners in machine learning and data science, offering an incremental compilation of existing methods without introducing new innovations.
This paper provides a tutorial and survey of nonlinear dimensionality reduction and feature extraction methods based on the Laplacian of data graphs, covering techniques such as spectral clustering, Laplacian eigenmap, locality preserving projection, graph embedding, and diffusion map.
This is a tutorial and survey paper for nonlinear dimensionality and feature extraction methods which are based on the Laplacian of graph of data. We first introduce adjacency matrix, definition of Laplacian matrix, and the interpretation of Laplacian. Then, we cover the cuts of graph and spectral clustering which applies clustering in a subspace of data. Different optimization variants of Laplacian eigenmap and its out-of-sample extension are explained. Thereafter, we introduce the locality preserving projection and its kernel variant as linear special cases of Laplacian eigenmap. Versions of graph embedding are then explained which are generalized versions of Laplacian eigenmap and locality preserving projection. Finally, diffusion map is introduced which is a method based on Laplacian of data and random walks on the data graph.