filmov
tv
Romain Couillet | Spectral clustering in sparse and heterogeneous networks

Показать описание
Watch Romain Couillet's talk, presented by Lorenzo Dall’Amico, during the First French-German Meeting in Physics, Mathematics and Artificial Intelligence Theory that took place from November 4 to 6, 2019 in Paris.
Abstract:
Spectral clustering is one of the most popular, yet still incompletely understood, methods for community detection on graphs. This talk presents a spectral clustering algorithm based on the Bethe-Hessian matrix for sparse and heterogeneous graphs. The proposed algorithm is capable of retrieving communities in this setting and to accurately estimate the number of communities. Strong connections are presented with other commonly used spectral clustering techniques, from both statistical physics and mathematics perspectives.
_____
Follow us on:
Abstract:
Spectral clustering is one of the most popular, yet still incompletely understood, methods for community detection on graphs. This talk presents a spectral clustering algorithm based on the Bethe-Hessian matrix for sparse and heterogeneous graphs. The proposed algorithm is capable of retrieving communities in this setting and to accurately estimate the number of communities. Strong connections are presented with other commonly used spectral clustering techniques, from both statistical physics and mathematics perspectives.
_____
Follow us on: