This page provides further information about the paper Finding overlapping communities using disjoint community detection algorithms.
Results of running the experiments reported in Figs. 4-10 of the paper with s=0. This is to prove that the value of parameter s is not critical: it can safely be set to 0, its smallest possible value.
| Network in "edges" format | Original | Notes |
|---|---|---|
| netscience | http://www-personal.umich.edu/~mejn/netdata/netscience.zip | My version contains only the largest component (n=379). |
| cond-mat-2003 | http://www-personal.umich.edu/~mejn/netdata/cond-mat-2003.zip | My version contains only the largest component (n=27519). |
| blogs | ||
| blogs2 | ||
| PGP | http://deim.urv.cat/~aarenas/data/xarxes/PGP.zip | |
| http://deim.urv.cat/~aarenas/data/xarxes/email.zip | ||
| word_association | http://www.cfinder.org/ | |
| protein-protein | http://www.cfinder.org/ |
The program used for the experiments in the paper is available here:
However, you are advised to use the latest version.