›Weakly Connected Components & Degree Centrality
2.4 · Lesson

Weakly Connected Components & Degree Centrality

LouvainA 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.

Comparison of Louvain, Degree Centrality, and WCC algorithms with labeled characteristics.