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

Look for Gephi Plugins

Popular Keywords

Close Search

Girvan Newman Clustering

Girvan Newman Clustering
9 votes, 3.11 avg. rating (64% score)

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 edges are the most central to communities, the Girvan–Newman algorithm focuses on edges that are most likely “between” communities.

Similar Plugins

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

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

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