DeepAI AI Chat
Log In Sign Up

Spectral embedding of regularized block models

by   Nathan de Lara, et al.
Télécom Paris

Spectral embedding is a popular technique for the representation of graph data. Several regularization techniques have been proposed to improve the quality of the embedding with respect to downstream tasks like clustering. In this paper, we explain on a simple block model the impact of the complete graph regularization, whereby a constant is added to all entries of the adjacency matrix. Specifically, we show that the regularization forces the spectral embedding to focus on the largest blocks, making the representation less sensitive to noise or outliers. We illustrate these results on both on both synthetic and real data, showing how regularization improves standard clustering scores.


page 1

page 2

page 3

page 4


Understanding Regularized Spectral Clustering via Graph Conductance

This paper uses the relationship between graph conductance and spectral ...

Graph Encoder Embedding

In this paper we propose a lightning fast graph embedding method called ...

Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

Vertex clustering in a stochastic blockmodel graph has wide applicabilit...

On the Surprising Behaviour of node2vec

Graph embedding techniques are a staple of modern graph learning researc...

Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint

In this paper, we propose a scalable algorithm for spectral embedding. T...

Impact of regularization on Spectral Clustering

The performance of spectral clustering can be considerably improved via ...

Spectral embedding for dynamic networks with stability guarantees

We consider the problem of embedding a dynamic network, to obtain time-e...