A Unified Framework for Spectral Clustering in Sparse Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Machine Learning Research Année : 2021

A Unified Framework for Spectral Clustering in Sparse Graphs

Résumé

This article considers spectral community detection in the regime of sparse networks with heterogeneous degree distributions, for which we devise an algorithm to efficiently retrieve communities. Specifically, we demonstrate that a well parametrized form of regularized Laplacian matrices can be used to perform spectral clustering in sparse networks without suffering from its degree heterogeneity. Besides, we exhibit important connections between this proposed matrix and the now popular non-backtracking matrix, the Bethe-Hessian matrix, as well as the standard Laplacian matrix. Interestingly, as opposed to competitive methods, our proposed improved parametrization inherently accounts for the hardness of the classification problem. These findings are summarized under the form of an algorithm capable of both estimating the number of communities and achieving high-quality community reconstruction.
Fichier principal
Vignette du fichier
20-261.pdf (1.77 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03372407 , version 1 (10-10-2021)

Identifiants

  • HAL Id : hal-03372407 , version 1

Citer

Lorenzo Dall'Amico, Romain Couillet, Nicolas Tremblay. A Unified Framework for Spectral Clustering in Sparse Graphs. Journal of Machine Learning Research, 2021, 22 (217), pp.1-56. ⟨hal-03372407⟩
60 Consultations
90 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More