Various clustering algoriths packaged as plugins for CLICS.
Note: Due to a mis-specified dependency (see #3), pyclics must be installed prior to installing pyclics-clustering.
As implemented in the networkx package.
The algorithm is described in
Ahn YY, Bagrow JP and Lehmann S: Link communities reveal multiscale complexity in networks. Nature 466, 761 (2010).
The implementation is copied from Tamás Nepusz with slight modifications to work with CLICS networks.
The algorithm is described in
Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Renaud Lefebvre: Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 10 (2008), P10008 (12pp).
We use the implementation by Thomas Aynaud.
The algorithm is described in
Cordasco, G., & Gargano, L.: Community detection via semi-synchronous label propagation algorithms. In Business Applications of Social Network Analysis (BASNA), 2010 IEEE International Workshop on (pp. 1-8). IEEE.
As implemented in the networkx package.