Live briefing
Everything about Louvain method
Clustering and community detection algorithm
The Louvain method for community detection is a greedy optimization method intended to extract non-overlapping communities from large networks created by Blondel et al. from the University of Louvain. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Louvain methodA 5-minute orientation
- Skim a recent paper: A Knowledge Discovery Method for Landslide Monitoring Based on K-Core Decomposition and the Louvain AlgorithmInfluential work since 2022
- Pick up a classic book: Aristote et les problèmes de méthodeThe most-reprinted book on the subject
- Read the landmark paper: A Simple Acceleration Method for the Louvain AlgorithmCited 32 times
- Go sideways: Leiden algorithmA closely related topic
- Go sideways: Community structureA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
A Simple Acceleration Method for the Louvain Algorithm
Isolate sets partition benefits community detection of parallel Louvain method
A variance-aware multiobjective Louvain-like method for community detection in multiplex networks
Discovering transition patterns among OpenStreetMap feature classes based on the Louvain method
Study on Discovery Method of Cooperative Research Team Based on Improved Louvain Algorithm
A modified method on improving power grid resilience based on the Louvain algorithm
Isolate Sets Based Parallel Louvain Method for Community Detection
Community Structure Analysis using Fast Louvain Method in Real World Networks
🆕 Influential since 2022
A Knowledge Discovery Method for Landslide Monitoring Based on K-Core Decomposition and the Louvain Algorithm
An Anomaly Detection Method for Multiple Time Series Based on Similarity Measurement and Louvain Algorithm
A Graphical Approach for Botnet Detection in IoT Edge Environments Using a Lightweight Dynamic Louvain Method
A Probabilistic Linguistic Large-Group Emergency Decision-Making Method Based on the Louvain Algorithm and Group Pressure Model
Community Detection in Scientific Collaboration Networks using the Louvain Method
📚 Books worth reading
Aristote et les problèmes de méthodeSymposium Aristotelicum (1960 Louvain, Belgium) · 1961
Questions disputées d'Ancien TestamentJournées bibliques de Louvain (23rd 1972) · 1989- 📕Questions disputées d'Ancien TestamentJournées bibliques de Louvain (23rd 1972) · 1974
- 📕Methods of separation of subcellular structural componentsChristian De Duve, James Kerr Grant · 1963
Le Livre de La Mithode Du Midecin de 'Alib. Ridwan (998-1067). Texte Iditi, Traduit Et Commenti. T. I: Introduction - Thirapeutique. (Publications de L'Institut Orientaliste de Louvain)'Ali, ʻAlī ibn Riḍwān · 1979- 📕La peinture dans les pays-bas au 16e siècleColloque pour l'étude du dessin sous-jacent et de la technologie de la peinture (12th 1997 Louvain, Belgium) · 1999
- 📕NumismatiqueHubert Frère · 1982
- 📕Louvain UniversityBelgium · 1904
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Leiden algorithm The Leiden algorithm is a community detection algorithm developed by Traag et al at Leiden University. It was developed as a modification of the Louvain…
- Community structure In the study of complex networks, a network is said to have community structure if the nodes of the network can be easily grouped into (potentially overlapping)…
- Modularity (networks) Modularity is a measure of the structure of networks or graphs which measures the strength of division of a network into modules (also called groups, clusters…
- Graph partition In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges…
- Graph neural network Graph neural networks (GNNs) are artificial neural networks designed for tasks whose inputs are graphs. Because graphs usually do not have a canonical…
- Stochastic block model The stochastic block model is a generative model for random graphs. This model tends to produce graphs containing communities, subsets of nodes characterized…
- Graph Coarsening Algorithm A Graph Coarsening Algorithm is a family of metaheuristic algorithms used to reduce the size and complexity of a large graph while preserving its key structural…
- Lancichinetti–Fortunato–Radicchi benchmark Lancichinetti–Fortunato–Radicchi benchmark is an algorithm that generates benchmark networks (artificial networks that resemble real-world networks). They…