Advanced Graph Clustering Methods: A Comprehensive and In-Depth Analysis

Timothé Watteau, Aubin Bonnefoy, Simon Illouz-Laurent, Joaquim Jusseau, Serge Iovleff
7/12/2024
stat.MLcs.LG

No official code found. Best implementation: timothewt/AdvancedGraphClustering (6 stars, MIT, last commit 2024-06-01).

Abstract

Graph clustering, which aims to divide a graph into several homogeneous groups, is a critical area of study with applications that span various fields such as social network analysis, bioinformatics, and image segmentation. This paper explores both traditional and more recent approaches to graph clustering. Firstly, key concepts and definitions in graph theory are introduced. The background section covers essential topics, including graph Laplacians and the integration of Deep Learning in graph analysis. The paper then delves into traditional clustering methods, including Spectral Clustering and the Leiden algorithm. Following this, state-of-the-art clustering techniques that leverage deep learning are examined. A comprehensive comparison of these methods is made through experiments. The paper concludes with a discussion of the practical applications of graph clustering and potential future research directions.

View on arXivView PDF

Code Implementations(1)

MIT

Advanced Graph Clustering method documentation and implementation (From Spectral Clustering to Deep Graph Clustering)

63Python, Jupyter NotebookMar 19, 20242 years agoMIT
argaclusteringdeep-graph-clusteringdgaegae+10 more

Similar Papers

Cite this paper

@article{watteau2024advanced,
  title  = {Advanced Graph Clustering Methods: A Comprehensive and In-Depth Analysis},
  author = {Timothé Watteau and Aubin Bonnefoy and Simon Illouz-Laurent and Joaquim Jusseau and Serge Iovleff},
  year   = {2024},
  eprint = {2407.09055},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.09055v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.09055.svg)](https://codeofpaper.com/paper/2407.09055)

Discussion