This repository regroups all the experiments published in my thesis entitled "Efficient and Robust Data Clustering with Graph Signal Processing".

Requirements

All the experiments assume the possession of the following toolboxes:

• GSPBox
• Johan Paratte's thesis repo, for the datasets
• CBR Selector, optionnal
• Export Fig, optional

Please follow the installation instructions of the GSPBox before to run the code of the experiments.

Algorithms

The folder algorithms contain all the code to perform the computations of the different experiments. Only part of it is original content. Please read the files header for individual credit attributions.

Experimental content

Chapter 3 - Fast Approximation of Spectral Clustering for Dynamic Networks

• [Figure 3.1](./experiments/chapter3/
• [Figure 3.2](./experiments/chapter3/
• [Figure 3.3](./experiments/chapter3/
• [Figure 3.4](./experiments/chapter3/
• [Figure 3.5](./experiments/chapter3/
• [Figure 3.6](./experiments/chapter3/
• [Figure 3.7](./experiments/chapter3/
• [Figure 3.8](./experiments/chapter3/
• [Table 3.1](./experiments/chapter3/

Chapter 4 - Approaching Laplacian Eigenspaces with Random Signals

• Figure 4.1
• Figure 4.2
• Figure 4.3
• Figure 4.4
• Figure 4.5
• Figure 4.6
• Table 4.1
• Table 4.2
• Table 4.3
• Table 4.4
• Table 4.5
• Table 4.6

Chapter 5 - Filter Localization for Graph Clustering

• Figure 5.1
• Figure 5.2
• Figure 5.3
• Figure 5.4
• Figure 5.5
• Table 5.1
• Table 5.2
• Table 5.3
• Tables 5.4 - 5.9