Table 7 Clustering performance of real-world big graph data
From: Limited random walk algorithm for big graph data clustering
| Â | com-Amazon | com-Youtube | com-LiveJournal | com-Orkut |
|---|---|---|---|---|
Vertices | 334,863 | 1,134,890 | 3,997,962 | 3,072,441 |
Edges | 925,872 | 2,987,624 | 34,681,189 | 117,185,083 |
CPU cores (graph exploration) | 12 | 96 | 96 | 96 |
Memory per CPU core | 4G | 4G | 8G | 8G |
Graph exploration (in hours) | 0.83 | 3.08 | 17.4 | 24.0 |
Cluster merging (in hours) | 0.20 | 1.34 | 9.44 | 2.53 |
Clusters | 37,473 | 170,569 | 381,246 | 165,624 |
Rand index | 0.908 | 0.755 | 0.951 | 0.751 |