Generalized Louvain Method for Community Detection in Large Networks

Abstract

In this paper we present a novel strategy to discover the community structure of (possibly, large) networks. This approach is based on the well-know concept of network modularity optimization. To do so, our algorithm exploits a novel measure of edge centrality, based on the k-paths. This technique allows to efficiently compute a edge ranking in large networks in near linear time. Once the centrality ranking is calculated, the algorithm computes the pairwise proximity between nodes of the network. Finally, it discovers the community structure adopting a strategy inspired by the well-known state-of-the-art Louvain method (henceforth, LM), efficiently maximizing the network modularity. The experiments we carried out show that our algorithm outperforms other techniques and slightly improves results of the original LM, providing reliable results. Another advantage is that its adoption is naturally extended even to unweighted networks, differently with respect to the LM.

6 pages, 1 figure, ISDA '11: 11th International Conference On Intelligent Systems Design And Applications, 2011

References in corpus (7)

• Fast unfolding of communities in large networks
• Finding community structure in networks using the eigenvectors of matrices
• Benchmark graphs for testing community detection algorithms
• Resolution limit in community detection
• Comparing community structure identification
• Mixture models and exploratory analysis in networks
• A Novel Measure of Edge Centrality in Social Networks

Cited by in corpus (27)

• A Novel Measure of Edge Centrality in Social Networks
• Enhancing community detection using a network weighting strategy
• A Large-Scale Community Structure Analysis In Facebook
• Network polarization, filter bubbles, and echo chambers: An annotated review of measures and reduction methods
• IEDC: An Integrated Approach for Overlapping and Non-overlapping Community Detection
• Forensic Analysis of Phone Call Networks
• Personality correlates of key roles in informal advice networks
• Embedding-based Silhouette Community Detection
• Rethinking Sensors Modeling: Hierarchical Information Enhanced Traffic Forecasting
• A Generalized and Adaptive Method for Community Detection
• Forest Fire Clustering for Single-cell Sequencing with Iterative Label Propagation and Parallelized Monte Carlo Simulation
• Brand Intelligence Analytics
• Visualizing criminal networks reconstructed from mobile phone records
• Mapping robust multiscale communities in chromosome contact networks
• On Comparing and Enhancing Common Approaches to Network Community Detection
• Quantifying Grover speed-ups beyond asymptotic analysis
• Networks of Power: Analyzing World Leaders Interactions on Social Media
• Fields, Bridges, and Foundations: How Researchers Browse Citation Network Visualizations
• A new method for community detection in social networks based on message distribution
• Community Detection Clustering via Gumbel Softmax
• ECHO: Encoding Communities via High-order Operators
• The Morbid Realities of Social Media: An Investigation into the Misinformation Shared by the Deceased Victims of COVID-19
• Brain-Network Clustering via Kernel-ARMA Modeling and the Grassmannian
• Compressive Sensing for cut improvement and local clustering
• Towards Robust Artificial Intelligence: Self-Supervised Learning Approach for Out-of-Distribution Detection
• Learning differentially reorganizes brain activity and connectivity
• A System for Identifying and Visualizing Influential Communities