flâneur — a map of the web's best reading

The graph Laplacian - Matthew N. Bernstein

mbernste.github.io · 1,997 words · saved by 1 readers

At the heart of of a number of important machine learning algorithms, such as spectral clustering, lies a matrix called the graph Laplacian. In this post, I’ll walk through the intuition behind the graph Laplacian and describe how it represents the discrete analogue to the Laplacian operator on continuous multivariate functions.

At the heart of of a number of important machine learning algorithms, such as spectral clustering, lies a matrix called the graph Laplacian. In this post, I’ll walk through the intuition behind the graph Laplacian and describe how it represents the discrete analogue to the Laplacian operator on continuous multivariate functions. Introduction At the heart of the field of spectral graph theory as well as a number of important machine learning algorithms, such as spectral clustering , lies a matrix called the graph Laplacian . (In fact, the first step in spectral clustering is to compute the Lapl

Explore this link on the map →

saved by

related reading