Table 3 Global graph clustering results on the ego-Facebook graph
From: Limited random walk algorithm for big graph data clustering
| Â | GN | Louvain | Infomap | MCL | LRW |
|---|---|---|---|---|---|
Mean conductance | 0.156 | 0.133 | 0.397 | 0.0882 | 0.0770 |
NMI | 0.778 | 0.796 | 0.723 | 0.908 | 0.910 |
Number of clusters | 16 | 19 | 76 | 10 | 10 |