community detection
A family of algorithms that group nodes by how they connect. Each algorithm defines a community differently.
Example
Two groups of three, joined by a single relationship between Cleo and Dan.
Weakly Connected Components returns one community. Every node is reachable from every other.
Louvain returns two. The relationship between Cleo and Dan is the only one crossing between the groups.
Lessons that use this term
The lesson and course links below open in a new tab.
No published lesson uses this term yet.