Hybrid Graph Embeddings and Louvain Algorithm for Unsupervised Community Detection

Dalila Khettaf, Djamel Djenouri, Zeinab Rezaeifar, Youcef Djenouri
9/27/2025
cs.SIcs.AI

No confident code implementation found for this paper.

Abstract

This paper proposes a novel community detection method that integrates the Louvain algorithm with Graph Neural Networks (GNNs), enabling the discovery of communities without prior knowledge. Compared to most existing solutions, the proposed method does not require prior knowledge of the number of communities. It enhances the Louvain algorithm using node embeddings generated by a GNN to capture richer structural and feature information. Furthermore, it introduces a merging algorithm to refine the results of the enhanced Louvain algorithm, reducing the number of detected communities. To the best of our knowledge, this work is the first one that improves the Louvain algorithm using GNNs for community detection. The improvement of the proposed method was empirically confirmed through an evaluation on real-world datasets. The results demonstrate its ability to dynamically adjust the number of detected communities and increase the detection accuracy in comparison with the benchmark solutions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{khettaf2025hybrid,
  title  = {Hybrid Graph Embeddings and Louvain Algorithm for Unsupervised Community Detection},
  author = {Dalila Khettaf and Djamel Djenouri and Zeinab Rezaeifar and Youcef Djenouri},
  year   = {2025},
  eprint = {2509.23411},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.23411v1}
}

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/2509.23411.svg)](https://codeofpaper.com/paper/2509.23411)

Discussion