Projects that are tagged with graph partitioning.


Logo 1SpectralClustering 1.1

by tbuehler - June 27, 2011, 10:45:57 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 5997 views, 1130 downloads, 1 subscription

About: A fast and scalable graph-based clustering algorithm based on the eigenvectors of the nonlinear 1-Laplacian.

Changes:
  • fixed bug occuring when input graph is disconnected
  • reduced memory usage when input graph has large number of disconnected components
  • more user-friendly usage of main method OneSpectralClustering
  • faster computation of eigenvector initialization + now thresholded according to multicut-criterion
  • several internal optimizations

Logo pSpectralClustering 1.0

by tbuehler - August 10, 2009, 23:03:41 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 4046 views, 903 downloads, 1 subscription

About: A generalized version of spectral clustering using the graph p-Laplacian.

Changes:

Initial Announcement on mloss.org.