Multiscale analysis on graphs

author: Mauro Maggioni, Duke University
published: Feb. 25, 2007,   recorded: May 2005,   views: 4625

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography


Analysis on graphs has recently been shown to lead to powerful algorithms in learning, in particular for regression, classification andclustering. Eigenfunctions of the Laplacian on a graph are a natural basis for analyzing functions on a graph, as we have seen in presentations of recent work by partecipants to this conference. In this talk we introduce a new flexible set of basis functions, called Diffusion Wavelets, that allow for a multiscale analysis of functions on a graph, very much in the same way classical wavelets perform a multiscale analysis in Euclidean spaces. They allow efficient, representation, compression, denoising of functions on the graph, and are very well-suited for learning, as well as unsupervised algorithms. They are also associated with a multiscale decomposition of the graph, which has applications by itself. We will discuss this construction with several examples, going from signal processing on manifolds and graphs, to some recent preliminary applications to clustering and learning.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: