Live briefing
Everything about Leiden algorithm
Clustering and community detection 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 method. Like the Louvain method, the Leiden algorithm attempts to optimize modularity in extracting communities from networks; however, it addresses key issues present in the Louvain method, namely poorly connected communities and the resolution limit of modularity. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Leiden algorithmA 5-minute orientation
- Skim a recent paper: An improvement of the Leiden algorithm for influencer detectionInfluential work since 2022
- Pick up a classic book: Advances in Computer GamesThe most-reprinted book on the subject
- Read the landmark paper: Comparison between Louvain and Leiden Algorithm for Network Structure: A ReviewCited 52 times
- Go sideways: Louvain methodA closely related topic
- Go sideways: Modularity (networks)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Comparison between Louvain and Leiden Algorithm for Network Structure: A Review
Activated Protein C Resistance, the Factor V Leiden Mutation, and a Laboratory Testing Algorithm
An Improved Algorithm for Activated Protein C Resistance and Factor V Leiden Screening
Frequent Closed High-Utility Itemset Mining Algorithm Based on Leiden Community Detection and Compact Genetic Algorithm
From Leiden to Tel-Aviv University (TAU): exploring clustering solutions via a genetic algorithm
The Effect of Scoring Factor for Leiden Algorithm
Leiden Coloring Algorithm for Influencer Detection
Implementation of Multiplex Leiden Algorithm for Clustering Ancol Visitors
🆕 Influential since 2022
📚 Books worth reading
Advances in Computer GamesJaap van den Herik · 2012
Algorithmic Number TheoryWieb Bosma · 2000
Foundations of genetic algorithms 5Colin R. Reeves · 1999
Computers and GamesJaap van den Herik · 2011- 📕Algorithms for diophantine equationsBenne de Weger · 1988
- 📕DatastructuresTheodorus Petrus van der Weide · 1980
The 5-Minute Clinical ConsultFrank J. Domino, Robert A. Baldor · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Louvain method The Louvain method for community detection is a greedy optimization method intended to extract non-overlapping communities from large networks created…
- 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 cut optimization Graph cut optimization is a combinatorial optimization method applicable to a family of functions of discrete variables, named after the concept of cut…
- Correlation clustering Clustering is the problem of partitioning data points into groups based on similarity or dissimilarity. Correlation clustering is a clustering framework…
- Hyperbolic geometric graph A hyperbolic geometric graph (HGG) or hyperbolic geometric network (HGN) is a special type of spatial network where (1) latent coordinates of nodes are…
- Game theory on networks Game theory on networks is a field that studies strategy in competing interest interactions among rational or adaptive players that are affected by the…
- Network entropy In network science, the network entropy is a disorder measure derived from information theory to describe the level of randomness and the amount of information…