›Reducing Search Space with Louvain
2.3 · Lesson
Reducing Search Space with Louvain
You've learned how 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. finds communities 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..
Now let's put it to work. You'll project the fraud network, run Louvain, and see how it reduces your search space by 98%.
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