›Degree Centrality & WCC
2.4 · Lesson
Degree Centrality & WCC
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. helped us explore the fraud network. But for formal community assignment, we need algorithms that are deterministic, explainable, and give us precise control.
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