Gephi.org | Download Gephi | Blog | Gephi Store | Wiki | Forum | Support | Bugtracker

Look for Gephi Plugins

Popular Keywords

Close Search
Marketplace | Clusters RSS feed for this section

Label Propagation Clustering

A plugin that provides an implementation of the label propagation graph clustering algorithm described in (1). This plugin offers an animated mode which allows the visualization of the labels propagation over the graph nodes. This feature is helpful when studying the behaviour of the algorithm on specific use cases. The current implementation does not take [...]

More Info

Girvan Newman Clustering

The Girvan Newman Clustering plugin for Gephi. This plugin finds clusters in graph, which can be used in Social Network Analysis. The Girvan–Newman algorithm detects communities by progressively removing edges from the original network. The connected components of the remaining network are the comunnities. Instead of trying to construct a measure that tells us which [...]

More Info

Markov Cluster Algorithm (MCL)

The Markov Clustering plugin for Gephi. This plugin finds clusters in graph, which can be used in Social Network Analysis. Clustering on Graphs: The Markov Cluster Algorithm (MCL) MCL details are freely available at http://www.micans.org/mcl/

More Info

Molecular Complex Detection (MCODE) Clustering

The Molecular Complex Detection clustering plugin for Gephi. This plugin finds clusters in graph, which can be used in Social Network Analysis. Clustering on Graphs: details are available at http://www.biomedcentral.com/1471-2105/4/2

More Info

GC-Viz

The GC-Viz plugin contains the algorithms GAMer and DB-CSC for the clustering of graphs with node attributes. It also contains a layout for visualizing and comparing the clustering results. The plugin has been developed by Brigitte Boden, Roman Haag and Houran Ketabdar. The plugin is described in the following paper: Brigitte Boden, Roman Haag, and [...]

More Info

Chinese Whispers Clustering

Chinese Whispers Clustering according to the paper by Chris Biemann. The algorithm is time-linear (w.r.t. the number of edges), non-deterministic and extremely fast! The current implementation represents a simple variant (no random class mutations yet), works single-threaded and allows for a randomized (rgb-space) coloring of the resulting clusters giving a fast visual feedback. For questions [...]

More Info