From: Overlapping community finding with noisy pairwise constraints
Algorithm | Network parameters | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
\(\mu\) | Comm. Size | \(O_n\) | \(O_m\) | |||||||
0.1 | 0.3 | Small | Large | 10% | 50% | 2 | 4 | 6 | 8 | |
Hybrid | 0.566 | 0.530 | 0.567 | 0.529 | 0.768 | 0.328 | 0.763 | 0.552 | 0.469 | 0.408 |
AC-SLPA | 0.316 | 0.343 | 0.364 | 0.295 | 0.429 | 0.231 | 0.390 | 0.353 | 0.301 | 0.357 |
SLPA | 0.533 | 0.451 | 0.497 | 0.488 | 0.777 | 0.208 | 0.686 | 0.484 | 0.421 | 0.369 |