User Tools

Site Tools


code_examples

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
code_examples [2012/11/22 15:49]
melancon
code_examples [2012/11/22 15:57] (current)
melancon [Clustering & Aggregation]
Line 18: Line 18:
  
   * [[k-Means]]:​ this class implements a limited form of the usual k-means method. You give it a graph and it will compute clusters based on node positions.   * [[k-Means]]:​ this class implements a limited form of the usual k-means method. You give it a graph and it will compute clusters based on node positions.
 +  * [[Louvain]]:​ this class implements the Louvain clustering algorithm for a graph. It assigns nodes an integer value. Subgraphs, and the resulting quotient graph, can then be computed by calling the appropriate ''​EqualValue''​ and ''​Quotient Clustering''​ plug-ins from within Tulip, for example.
/net/html/perso/melancon/Visual_Analytics_Course/data/pages/code_examples.txt · Last modified: 2012/11/22 15:57 by melancon