›Louvain Community Detection
1.8 · Lesson
Louvain Community Detection
You may have already used iFull definition for Louvain algorithm (opens in a new tab)A community detection algorithm that repeatedly merges nodes into groups for as long as merging raises modularity. in the Graph Data Science in Practice workshop to detect fraud rings by optimizing iFull definition for modularity (opens in a new tab)A score for how much more densely connected the nodes within a group are than they would be by chance..
Join GraphAcademy to keep learning
Create your account to unlock 80+ hours of hands-on Neo4j courses, track your progress, and earn a certificate when you complete the course.
Sign in or register