SignedLouvain: Louvain for signed networks
John N. Pougu\'e-Biyong, Renaud Lambiotte

TL;DR
SignedLouvain is a novel algorithm that adapts the Louvain method to effectively detect communities in signed networks by maximizing signed modularity, improving accuracy while maintaining efficiency.
Contribution
The paper introduces SignedLouvain, a new variant of Louvain tailored for signed networks, overcoming previous limitations and enhancing community detection accuracy.
Findings
Improved community detection accuracy in signed networks.
Maintains scalability and speed of the original Louvain method.
Demonstrates effectiveness on real-world datasets.
Abstract
In this article, we consider the problem of community detection in signed networks. We propose SignedLouvain, an adaptation of the Louvain method to maximise signed modularity, efficiently taking advantage of the structure induced by signed relations. We begin by identifying the inherent limitations of applying the standard Louvain algorithm to signed networks, before introducing a novel variant specifically engineered to overcome these challenges. Through extensive experiments on real-world datasets, we demonstrate that the proposed method not only maintains the speed and scalability of its predecessor but also significantly enhances accuracy in detecting communities within signed networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolitical Systems and Governance
