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.565 | 0.483 | 0.538 | 0.510 | 0.809 | 0.239 | 0.709 | 0.538 | 0.448 | 0.401 |
AC-SLPA | 0.484 | 0.43 | 0.475 | 0.438 | 0.691 | 0.223 | 0.602 | 0.472 | 0.402 | 0.351 |
SLPA | 0.527 | 0.388 | 0.474 | 0.441 | 0.737 | 0.178 | 0.634 | 0.458 | 0.396 | 0.342 |